./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.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-50_file-40.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 bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:38:10,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:38:10,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:38:10,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:38:10,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:38:10,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:38:10,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:38:10,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:38:10,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:38:10,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:38:10,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:38:10,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:38:10,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:38:10,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:38:10,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:38:10,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:38:10,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:38:10,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:38:10,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:38:10,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:38:10,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:38:10,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:38:10,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:38:10,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:38:10,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:38:10,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:38:10,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:38:10,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:38:10,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:38:10,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:38:10,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:38:10,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:38:10,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:38:10,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:38:10,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:38:10,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:38:10,273 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 -> bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 [2024-11-12 02:38:10,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:38:10,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:38:10,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:38:10,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:38:10,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:38:10,508 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-50_file-40.i [2024-11-12 02:38:11,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:38:11,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:38:11,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-11-12 02:38:11,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb2b37b4/d2bc580c88444cc8885f8ef346261b68/FLAGfae26c8a8 [2024-11-12 02:38:12,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb2b37b4/d2bc580c88444cc8885f8ef346261b68 [2024-11-12 02:38:12,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:38:12,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:38:12,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:38:12,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:38:12,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:38:12,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e46d148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12, skipping insertion in model container [2024-11-12 02:38:12,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:38:12,453 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-50_file-40.i[915,928] [2024-11-12 02:38:12,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:38:12,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:38:12,556 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-50_file-40.i[915,928] [2024-11-12 02:38:12,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:38:12,637 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:38:12,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12 WrapperNode [2024-11-12 02:38:12,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:38:12,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:38:12,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:38:12,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:38:12,661 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:38:12" (1/1) ... [2024-11-12 02:38:12,676 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:38:12" (1/1) ... [2024-11-12 02:38:12,708 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-12 02:38:12,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:38:12,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:38:12,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:38:12,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:38:12,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,735 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:38:12,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:38:12,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:38:12,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:38:12,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:38:12,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (1/1) ... [2024-11-12 02:38:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:38:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:38:12,787 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:38:12,789 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:38:12,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:38:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:38:12,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:38:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:38:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:38:12,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:38:12,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:38:12,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:38:13,213 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 02:38:13,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:38:13,225 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:38:13,225 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:38:13,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:38:13 BoogieIcfgContainer [2024-11-12 02:38:13,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:38:13,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:38:13,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:38:13,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:38:13,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:38:12" (1/3) ... [2024-11-12 02:38:13,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e926680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:38:13, skipping insertion in model container [2024-11-12 02:38:13,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:12" (2/3) ... [2024-11-12 02:38:13,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e926680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:38:13, skipping insertion in model container [2024-11-12 02:38:13,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:38:13" (3/3) ... [2024-11-12 02:38:13,232 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-11-12 02:38:13,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:38:13,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:38:13,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:38:13,291 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;@7b297ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:38:13,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:38:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 02:38:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 02:38:13,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:13,314 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2098810620, now seen corresponding path program 1 times [2024-11-12 02:38:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:13,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781707563] [2024-11-12 02:38:13,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:13,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781707563] [2024-11-12 02:38:13,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781707563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:13,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:13,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:38:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426707726] [2024-11-12 02:38:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:13,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:38:13,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:38:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:38:13,856 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:13,878 INFO L93 Difference]: Finished difference Result 165 states and 288 transitions. [2024-11-12 02:38:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:38:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 02:38:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:13,886 INFO L225 Difference]: With dead ends: 165 [2024-11-12 02:38:13,886 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 02:38:13,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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:38:13,893 INFO L435 NwaCegarLoop]: 126 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, 126 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:38:13,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 02:38:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 02:38:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 02:38:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-12 02:38:13,926 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 173 [2024-11-12 02:38:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:13,927 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-12 02:38:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-12 02:38:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 02:38:13,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:13,930 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:38:13,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 99329031, now seen corresponding path program 1 times [2024-11-12 02:38:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:13,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820249703] [2024-11-12 02:38:13,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:14,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820249703] [2024-11-12 02:38:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820249703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:14,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:14,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:38:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991195129] [2024-11-12 02:38:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:14,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:38:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:38:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:38:14,411 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:14,539 INFO L93 Difference]: Finished difference Result 240 states and 372 transitions. [2024-11-12 02:38:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:38:14,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 02:38:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:14,544 INFO L225 Difference]: With dead ends: 240 [2024-11-12 02:38:14,544 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 02:38:14,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:38:14,545 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 197 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:14,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 305 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:38:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 02:38:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-12 02:38:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 02:38:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2024-11-12 02:38:14,568 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 174 [2024-11-12 02:38:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:14,569 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2024-11-12 02:38:14,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2024-11-12 02:38:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 02:38:14,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:14,571 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:38:14,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:14,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1589614711, now seen corresponding path program 1 times [2024-11-12 02:38:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:14,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937181778] [2024-11-12 02:38:14,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937181778] [2024-11-12 02:38:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937181778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:38:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186802952] [2024-11-12 02:38:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:38:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:38:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:38:14,683 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:14,732 INFO L93 Difference]: Finished difference Result 388 states and 605 transitions. [2024-11-12 02:38:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:38:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 02:38:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:14,736 INFO L225 Difference]: With dead ends: 388 [2024-11-12 02:38:14,736 INFO L226 Difference]: Without dead ends: 232 [2024-11-12 02:38:14,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:38:14,738 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:14,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 320 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-12 02:38:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2024-11-12 02:38:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 147 states have (on average 1.380952380952381) internal successors, (203), 148 states have internal predecessors, (203), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 02:38:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 343 transitions. [2024-11-12 02:38:14,778 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 343 transitions. Word has length 174 [2024-11-12 02:38:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:14,779 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 343 transitions. [2024-11-12 02:38:14,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 343 transitions. [2024-11-12 02:38:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 02:38:14,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:14,782 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:14,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:38:14,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1449066101, now seen corresponding path program 1 times [2024-11-12 02:38:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:14,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196213785] [2024-11-12 02:38:14,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:14,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:15,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196213785] [2024-11-12 02:38:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196213785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:15,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:15,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:38:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234440968] [2024-11-12 02:38:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:15,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:38:15,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:38:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:38:15,067 INFO L87 Difference]: Start difference. First operand 221 states and 343 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:15,110 INFO L93 Difference]: Finished difference Result 526 states and 820 transitions. [2024-11-12 02:38:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:38:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 02:38:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:15,114 INFO L225 Difference]: With dead ends: 526 [2024-11-12 02:38:15,116 INFO L226 Difference]: Without dead ends: 308 [2024-11-12 02:38:15,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:38:15,120 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 71 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:15,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 272 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-12 02:38:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2024-11-12 02:38:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 197 states have (on average 1.380710659898477) internal successors, (272), 198 states have internal predecessors, (272), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-12 02:38:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 464 transitions. [2024-11-12 02:38:15,163 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 464 transitions. Word has length 174 [2024-11-12 02:38:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:15,164 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 464 transitions. [2024-11-12 02:38:15,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 464 transitions. [2024-11-12 02:38:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 02:38:15,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:15,167 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:38:15,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:15,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1822091790, now seen corresponding path program 1 times [2024-11-12 02:38:15,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:15,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466177484] [2024-11-12 02:38:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466177484] [2024-11-12 02:38:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466177484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:15,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:15,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:38:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117762079] [2024-11-12 02:38:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:38:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:38:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:38:15,357 INFO L87 Difference]: Start difference. First operand 298 states and 464 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:15,396 INFO L93 Difference]: Finished difference Result 734 states and 1143 transitions. [2024-11-12 02:38:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:38:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 02:38:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:15,401 INFO L225 Difference]: With dead ends: 734 [2024-11-12 02:38:15,401 INFO L226 Difference]: Without dead ends: 439 [2024-11-12 02:38:15,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:38:15,403 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 70 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:15,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 270 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-12 02:38:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2024-11-12 02:38:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 290 states have (on average 1.3724137931034484) internal successors, (398), 292 states have internal predecessors, (398), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 02:38:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 678 transitions. [2024-11-12 02:38:15,445 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 678 transitions. Word has length 175 [2024-11-12 02:38:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 678 transitions. [2024-11-12 02:38:15,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 678 transitions. [2024-11-12 02:38:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 02:38:15,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:15,448 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 02:38:15,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:15,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1273209232, now seen corresponding path program 1 times [2024-11-12 02:38:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896577578] [2024-11-12 02:38:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:15,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:15,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896577578] [2024-11-12 02:38:15,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896577578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:15,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:15,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:38:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590599286] [2024-11-12 02:38:15,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:15,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:38:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:38:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:38:15,571 INFO L87 Difference]: Start difference. First operand 437 states and 678 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:15,610 INFO L93 Difference]: Finished difference Result 871 states and 1353 transitions. [2024-11-12 02:38:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:38:15,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 02:38:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:15,613 INFO L225 Difference]: With dead ends: 871 [2024-11-12 02:38:15,613 INFO L226 Difference]: Without dead ends: 437 [2024-11-12 02:38:15,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:38:15,616 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:15,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-12 02:38:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-12 02:38:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 290 states have (on average 1.3517241379310345) internal successors, (392), 292 states have internal predecessors, (392), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 02:38:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2024-11-12 02:38:15,653 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 175 [2024-11-12 02:38:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:15,656 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2024-11-12 02:38:15,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2024-11-12 02:38:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 02:38:15,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:15,658 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 02:38:15,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2082555858, now seen corresponding path program 1 times [2024-11-12 02:38:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812031415] [2024-11-12 02:38:15,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:15,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812031415] [2024-11-12 02:38:15,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812031415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:15,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:15,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:38:15,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161015523] [2024-11-12 02:38:15,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:15,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:38:15,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:15,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:38:15,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:38:15,973 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:16,155 INFO L93 Difference]: Finished difference Result 726 states and 1116 transitions. [2024-11-12 02:38:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:38:16,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 02:38:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:16,159 INFO L225 Difference]: With dead ends: 726 [2024-11-12 02:38:16,159 INFO L226 Difference]: Without dead ends: 508 [2024-11-12 02:38:16,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:38:16,160 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 175 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:16,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 462 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:38:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-12 02:38:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 485. [2024-11-12 02:38:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 325 states have (on average 1.353846153846154) internal successors, (440), 328 states have internal predecessors, (440), 152 states have call successors, (152), 7 states have call predecessors, (152), 7 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-12 02:38:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 744 transitions. [2024-11-12 02:38:16,198 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 744 transitions. Word has length 175 [2024-11-12 02:38:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:16,198 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 744 transitions. [2024-11-12 02:38:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 744 transitions. [2024-11-12 02:38:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 02:38:16,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:16,200 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:16,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 02:38:16,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash 624063536, now seen corresponding path program 1 times [2024-11-12 02:38:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009797427] [2024-11-12 02:38:16,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:16,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009797427] [2024-11-12 02:38:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009797427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:38:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188126980] [2024-11-12 02:38:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:16,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:38:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:38:16,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:38:16,509 INFO L87 Difference]: Start difference. First operand 485 states and 744 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:16,702 INFO L93 Difference]: Finished difference Result 889 states and 1363 transitions. [2024-11-12 02:38:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:38:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 02:38:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:16,706 INFO L225 Difference]: With dead ends: 889 [2024-11-12 02:38:16,706 INFO L226 Difference]: Without dead ends: 622 [2024-11-12 02:38:16,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:38:16,708 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 181 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:16,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 526 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:38:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-12 02:38:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 543. [2024-11-12 02:38:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 370 states have (on average 1.3621621621621622) internal successors, (504), 374 states have internal predecessors, (504), 164 states have call successors, (164), 8 states have call predecessors, (164), 8 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-12 02:38:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 832 transitions. [2024-11-12 02:38:16,751 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 832 transitions. Word has length 175 [2024-11-12 02:38:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:16,752 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 832 transitions. [2024-11-12 02:38:16,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 832 transitions. [2024-11-12 02:38:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 02:38:16,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:16,754 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 02:38:16,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 308152387, now seen corresponding path program 1 times [2024-11-12 02:38:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545313923] [2024-11-12 02:38:16,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:16,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:16,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545313923] [2024-11-12 02:38:16,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545313923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:16,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:38:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646532080] [2024-11-12 02:38:16,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:16,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:38:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:38:16,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:38:16,952 INFO L87 Difference]: Start difference. First operand 543 states and 832 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:17,011 INFO L93 Difference]: Finished difference Result 959 states and 1461 transitions. [2024-11-12 02:38:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:38:17,011 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-12 02:38:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:17,015 INFO L225 Difference]: With dead ends: 959 [2024-11-12 02:38:17,015 INFO L226 Difference]: Without dead ends: 686 [2024-11-12 02:38:17,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:38:17,017 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 67 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:17,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 299 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-12 02:38:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 638. [2024-11-12 02:38:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 439 states have (on average 1.3530751708428246) internal successors, (594), 445 states have internal predecessors, (594), 188 states have call successors, (188), 10 states have call predecessors, (188), 10 states have return successors, (188), 182 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-12 02:38:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 970 transitions. [2024-11-12 02:38:17,066 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 970 transitions. Word has length 176 [2024-11-12 02:38:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 970 transitions. [2024-11-12 02:38:17,067 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 970 transitions. [2024-11-12 02:38:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 02:38:17,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:17,070 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 02:38:17,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:17,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -112433918, now seen corresponding path program 1 times [2024-11-12 02:38:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622409296] [2024-11-12 02:38:17,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:17,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:17,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622409296] [2024-11-12 02:38:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622409296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 02:38:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610701677] [2024-11-12 02:38:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:17,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 02:38:17,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 02:38:17,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:38:17,386 INFO L87 Difference]: Start difference. First operand 638 states and 970 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:17,818 INFO L93 Difference]: Finished difference Result 1866 states and 2766 transitions. [2024-11-12 02:38:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 02:38:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-12 02:38:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:17,825 INFO L225 Difference]: With dead ends: 1866 [2024-11-12 02:38:17,825 INFO L226 Difference]: Without dead ends: 1231 [2024-11-12 02:38:17,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:38:17,828 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:17,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 529 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:38:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-12 02:38:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 968. [2024-11-12 02:38:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 669 states have (on average 1.3064275037369208) internal successors, (874), 685 states have internal predecessors, (874), 278 states have call successors, (278), 20 states have call predecessors, (278), 20 states have return successors, (278), 262 states have call predecessors, (278), 278 states have call successors, (278) [2024-11-12 02:38:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1430 transitions. [2024-11-12 02:38:17,968 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1430 transitions. Word has length 176 [2024-11-12 02:38:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1430 transitions. [2024-11-12 02:38:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1430 transitions. [2024-11-12 02:38:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 02:38:17,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:17,970 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 02:38:17,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash -110586876, now seen corresponding path program 1 times [2024-11-12 02:38:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:17,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709426120] [2024-11-12 02:38:17,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:38:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:38:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 02:38:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:38:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:38:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:38:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:38:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:38:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:38:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:38:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:38:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:38:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:38:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:38:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:38:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:38:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:38:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:38:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:38:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:38:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:38:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 02:38:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:38:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:38:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 02:38:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:38:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 02:38:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:38:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709426120] [2024-11-12 02:38:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709426120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:38:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873309668] [2024-11-12 02:38:18,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:38:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:38:18,250 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:38:18,251 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:38:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:18,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:38:18,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:38:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-12 02:38:18,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:38:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 02:38:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873309668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:38:18,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:38:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 02:38:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218806130] [2024-11-12 02:38:18,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:38:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:38:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:38:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:38:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:38:18,876 INFO L87 Difference]: Start difference. First operand 968 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:38:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:19,141 INFO L93 Difference]: Finished difference Result 1733 states and 2487 transitions. [2024-11-12 02:38:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 02:38:19,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 176 [2024-11-12 02:38:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:19,146 INFO L225 Difference]: With dead ends: 1733 [2024-11-12 02:38:19,147 INFO L226 Difference]: Without dead ends: 768 [2024-11-12 02:38:19,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:38:19,150 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 79 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:19,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 209 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:38:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-12 02:38:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 708. [2024-11-12 02:38:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 489 states have (on average 1.2351738241308794) internal successors, (604), 495 states have internal predecessors, (604), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 182 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-12 02:38:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 980 transitions. [2024-11-12 02:38:19,271 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 980 transitions. Word has length 176 [2024-11-12 02:38:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:19,271 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 980 transitions. [2024-11-12 02:38:19,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:38:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 980 transitions. [2024-11-12 02:38:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-12 02:38:19,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:19,273 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,287 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:38:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 02:38:19,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:19,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 590477702, now seen corresponding path program 1 times [2024-11-12 02:38:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:38:19,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536397787] [2024-11-12 02:38:19,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:38:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:38:19,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096382432] [2024-11-12 02:38:19,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:38:19,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:38:19,556 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:38:19,557 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:38:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:38:19,730 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:38:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:38:19,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:38:19,902 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:38:19,903 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:38:19,919 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:38:20,108 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,SelfDestructingSolverStorable11 [2024-11-12 02:38:20,112 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:38:20,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:38:20,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:38:20 BoogieIcfgContainer [2024-11-12 02:38:20,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:38:20,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:38:20,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:38:20,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:38:20,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:38:13" (3/4) ... [2024-11-12 02:38:20,223 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:38:20,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:38:20,225 INFO L158 Benchmark]: Toolchain (without parser) took 7945.49ms. Allocated memory was 190.8MB in the beginning and 339.7MB in the end (delta: 148.9MB). Free memory was 121.1MB in the beginning and 153.6MB in the end (delta: -32.5MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,225 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 85.0MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:38:20,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.77ms. Allocated memory is still 190.8MB. Free memory was 120.9MB in the beginning and 159.2MB in the end (delta: -38.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.44ms. Allocated memory is still 190.8MB. Free memory was 159.2MB in the beginning and 155.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,225 INFO L158 Benchmark]: Boogie Preprocessor took 45.64ms. Allocated memory is still 190.8MB. Free memory was 155.0MB in the beginning and 147.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,226 INFO L158 Benchmark]: RCFGBuilder took 469.93ms. Allocated memory is still 190.8MB. Free memory was 146.6MB in the beginning and 118.9MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,226 INFO L158 Benchmark]: TraceAbstraction took 6993.12ms. Allocated memory was 190.8MB in the beginning and 339.7MB in the end (delta: 148.9MB). Free memory was 118.1MB in the beginning and 154.7MB in the end (delta: -36.6MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,226 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 339.7MB. Free memory was 154.7MB in the beginning and 153.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 02:38:20,227 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.15ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 85.0MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.77ms. Allocated memory is still 190.8MB. Free memory was 120.9MB in the beginning and 159.2MB in the end (delta: -38.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.44ms. Allocated memory is still 190.8MB. Free memory was 159.2MB in the beginning and 155.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.64ms. Allocated memory is still 190.8MB. Free memory was 155.0MB in the beginning and 147.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 469.93ms. Allocated memory is still 190.8MB. Free memory was 146.6MB in the beginning and 118.9MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6993.12ms. Allocated memory was 190.8MB in the beginning and 339.7MB in the end (delta: 148.9MB). Free memory was 118.1MB in the beginning and 154.7MB in the end (delta: -36.6MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 339.7MB. Free memory was 154.7MB in the beginning and 153.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 86, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_31 = 0; [L42] unsigned char var_1_32 = 0; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 50; [L45] double var_1_35 = 31.1; [L46] double var_1_36 = 127.4; [L47] unsigned long int var_1_37 = 64; [L48] signed long int var_1_38 = 8; [L49] float var_1_39 = 200.6; [L50] unsigned short int var_1_40 = 2; [L51] signed char var_1_42 = -4; [L52] double var_1_43 = 2.75; [L53] double var_1_44 = 7.6; [L54] signed char var_1_45 = 32; [L55] unsigned long int var_1_46 = 32; [L56] signed long int var_1_47 = -256; [L57] unsigned char last_1_var_1_9 = 1; [L58] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L136] var_1_8 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L148] var_1_20 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L150] var_1_28 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L153] var_1_29 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L156] var_1_31 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L159] var_1_32 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L162] var_1_33 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L164] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L165] var_1_36 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L167] var_1_39 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L170] var_1_44 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L62] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L63] COND TRUE var_1_31 && var_1_32 [L64] var_1_30 = (((((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) < 0 ) ? -((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) : ((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L66] COND FALSE !(var_1_28 > var_1_30) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L71] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L72] COND FALSE !((var_1_31 && var_1_32) && (var_1_30 > var_1_34)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L75] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_35)) ? ((var_1_36 / var_1_39)) : (var_1_35))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L80] COND TRUE var_1_27 > ((var_1_29 >> 1) + var_1_37) [L81] var_1_40 = (((((var_1_33) < 0 ) ? -(var_1_33) : (var_1_33))) + ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L83] COND TRUE var_1_32 || var_1_31 [L84] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L86] EXPR var_1_42 | var_1_38 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L86] COND TRUE var_1_28 > (var_1_42 | var_1_38) [L87] var_1_43 = ((((var_1_36) > ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))))))) ? (var_1_36) : ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L89] var_1_45 = var_1_28 [L90] var_1_46 = var_1_33 [L91] var_1_47 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L92] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L99] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L101] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=-255, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L102] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L103] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L105] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L106] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L109] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L111] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L112] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L115] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L119] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L120] var_1_25 = var_1_20 [L121] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L122] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L123] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L127] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=-255, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=31, var_1_29=32, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=50, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=82, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=31, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1050 mSDsluCounter, 3562 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 1779 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 942 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=968occurred in iteration=10, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 498 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2451 NumberOfCodeBlocks, 2451 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2262 ConstructedInterpolants, 0 QuantifiedInterpolants, 4616 SizeOfPredicates, 1 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 16747/16900 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:38:20,254 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-50_file-40.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 bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:38:22,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:38:22,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:38:22,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:38:22,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:38:22,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:38:22,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:38:22,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:38:22,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:38:22,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:38:22,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:38:22,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:38:22,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:38:22,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:38:22,261 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:38:22,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:38:22,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:38:22,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:38:22,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:38:22,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:38:22,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:38:22,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:38:22,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:38:22,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:38:22,267 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:38:22,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:38:22,267 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:38:22,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:38:22,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:38:22,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:38:22,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:38:22,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:38:22,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:38:22,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:38:22,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:38:22,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:38:22,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:38:22,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:38:22,275 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:38:22,275 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:38:22,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:38:22,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:38:22,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:38:22,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:38:22,277 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 -> bc8129dbd625890f0a6c6fb8220f750f06e74365510b0e3af1c906da415c9ec4 [2024-11-12 02:38:22,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:38:22,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:38:22,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:38:22,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:38:22,621 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:38:22,622 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-50_file-40.i [2024-11-12 02:38:23,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:38:24,074 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:38:24,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-11-12 02:38:24,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43b8f1e3/bcc011f4a273477e921ae64a2f24bfcb/FLAGb3b04ce85 [2024-11-12 02:38:24,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43b8f1e3/bcc011f4a273477e921ae64a2f24bfcb [2024-11-12 02:38:24,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:38:24,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:38:24,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:38:24,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:38:24,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:38:24,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64583140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24, skipping insertion in model container [2024-11-12 02:38:24,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:38:24,308 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-50_file-40.i[915,928] [2024-11-12 02:38:24,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:38:24,403 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:38:24,414 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-50_file-40.i[915,928] [2024-11-12 02:38:24,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:38:24,471 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:38:24,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24 WrapperNode [2024-11-12 02:38:24,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:38:24,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:38:24,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:38:24,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:38:24,478 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:38:24" (1/1) ... [2024-11-12 02:38:24,496 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:38:24" (1/1) ... [2024-11-12 02:38:24,526 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-12 02:38:24,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:38:24,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:38:24,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:38:24,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:38:24,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,572 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:38:24,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:38:24,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:38:24,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:38:24,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:38:24,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (1/1) ... [2024-11-12 02:38:24,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:38:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:38:24,627 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:38:24,630 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:38:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:38:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:38:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:38:24,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:38:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:38:24,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:38:24,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:38:24,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:38:33,715 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 02:38:33,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:38:33,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:38:33,725 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:38:33,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:38:33 BoogieIcfgContainer [2024-11-12 02:38:33,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:38:33,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:38:33,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:38:33,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:38:33,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:38:24" (1/3) ... [2024-11-12 02:38:33,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39388b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:38:33, skipping insertion in model container [2024-11-12 02:38:33,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:38:24" (2/3) ... [2024-11-12 02:38:33,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39388b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:38:33, skipping insertion in model container [2024-11-12 02:38:33,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:38:33" (3/3) ... [2024-11-12 02:38:33,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-40.i [2024-11-12 02:38:33,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:38:33,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:38:33,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:38:33,806 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;@4a38af1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:38:33,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:38:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 02:38:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 02:38:33,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:33,824 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:33,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1629278474, now seen corresponding path program 1 times [2024-11-12 02:38:33,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:38:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330702553] [2024-11-12 02:38:33,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:33,844 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:38:33,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:38:33,847 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:38:33,848 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:38:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:34,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:38:34,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:38:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-12 02:38:34,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:38:34,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:38:34,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330702553] [2024-11-12 02:38:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330702553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:38:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895172320] [2024-11-12 02:38:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:38:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:38:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:38:34,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:38:34,758 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 02:38:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:34,783 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2024-11-12 02:38:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:38:34,785 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-12 02:38:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:34,791 INFO L225 Difference]: With dead ends: 159 [2024-11-12 02:38:34,791 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 02:38:34,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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:38:34,796 INFO L435 NwaCegarLoop]: 121 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, 121 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:38:34,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:38:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 02:38:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 02:38:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 02:38:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-12 02:38:34,833 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 172 [2024-11-12 02:38:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:34,833 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-12 02:38:34,834 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 02:38:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-12 02:38:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 02:38:34,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:34,837 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,860 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:38:35,037 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:38:35,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:35,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1244735805, now seen corresponding path program 1 times [2024-11-12 02:38:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:38:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625124139] [2024-11-12 02:38:35,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:35,041 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:38:35,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:38:35,042 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:38:35,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 02:38:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 02:38:35,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:38:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-12 02:38:38,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:38:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 02:38:40,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:38:40,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625124139] [2024-11-12 02:38:40,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625124139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:38:40,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:38:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 02:38:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151909762] [2024-11-12 02:38:40,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:38:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:38:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:38:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:38:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:38:40,886 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:38:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:45,577 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-12 02:38:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 02:38:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 173 [2024-11-12 02:38:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:45,583 INFO L225 Difference]: With dead ends: 243 [2024-11-12 02:38:45,584 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 02:38:45,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-12 02:38:45,585 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:45,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 416 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-12 02:38:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 02:38:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 81. [2024-11-12 02:38:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 02:38:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-12 02:38:45,606 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 173 [2024-11-12 02:38:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:45,607 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-12 02:38:45,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-12 02:38:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-12 02:38:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 02:38:45,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:45,610 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,636 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:38:45,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:38:45,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:45,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1945800383, now seen corresponding path program 1 times [2024-11-12 02:38:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:38:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014398480] [2024-11-12 02:38:45,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:45,813 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:38:45,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:38:45,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:38:45,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 02:38:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:46,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 02:38:46,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:38:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:46,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:38:46,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:38:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014398480] [2024-11-12 02:38:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014398480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:38:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257506882] [2024-11-12 02:38:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:38:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:38:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:38:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:38:46,754 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:46,858 INFO L93 Difference]: Finished difference Result 159 states and 233 transitions. [2024-11-12 02:38:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:38:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 02:38:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:46,869 INFO L225 Difference]: With dead ends: 159 [2024-11-12 02:38:46,869 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 02:38:46,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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:38:46,871 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:46,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:38:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 02:38:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 02:38:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 02:38:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-12 02:38:46,892 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 173 [2024-11-12 02:38:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:46,893 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-12 02:38:46,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-12 02:38:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 02:38:46,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:46,894 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 02:38:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:38:47,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1136453757, now seen corresponding path program 1 times [2024-11-12 02:38:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:38:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917031562] [2024-11-12 02:38:47,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:47,097 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:38:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:38:47,100 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:38:47,101 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:38:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:47,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 02:38:47,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:38:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 02:38:48,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:38:48,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:38:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917031562] [2024-11-12 02:38:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917031562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:38:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:38:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:38:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282773070] [2024-11-12 02:38:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:38:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:38:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:38:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:38:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:38:48,381 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:38:50,321 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2024-11-12 02:38:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 02:38:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-12 02:38:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:38:50,326 INFO L225 Difference]: With dead ends: 298 [2024-11-12 02:38:50,326 INFO L226 Difference]: Without dead ends: 220 [2024-11-12 02:38:50,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:38:50,330 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 203 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 02:38:50,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 554 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 02:38:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-12 02:38:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 135. [2024-11-12 02:38:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 02:38:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 194 transitions. [2024-11-12 02:38:50,366 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 194 transitions. Word has length 173 [2024-11-12 02:38:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:38:50,367 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 194 transitions. [2024-11-12 02:38:50,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 02:38:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 194 transitions. [2024-11-12 02:38:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 02:38:50,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:38:50,369 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 02:38:50,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:38:50,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:38:50,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:38:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1138300799, now seen corresponding path program 1 times [2024-11-12 02:38:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:38:50,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867708775] [2024-11-12 02:38:50,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:38:50,572 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:38:50,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:38:50,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:38:50,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 02:38:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:38:51,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 02:38:51,420 INFO L279 TraceCheckSpWp]: Computing forward predicates...