./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.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 9cba79950cf375b2c6722694000728483242da78ae2f3d704ca324604495c54e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:53:09,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:53:09,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:53:09,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:53:09,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:53:09,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:53:09,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:53:09,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:53:09,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:53:09,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:53:09,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:53:09,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:53:09,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:53:09,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:53:09,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:53:09,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:53:09,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:53:09,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:53:09,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:53:09,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:53:09,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:53:09,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:53:09,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:53:09,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:53:09,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:53:09,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:53:09,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:53:09,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:53:09,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:53:09,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:53:09,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:53:09,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:53:09,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:53:09,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:53:09,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:53:09,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:53:09,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:53:09,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:53:09,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:53:09,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:53:09,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:53:09,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:53:09,353 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 -> 9cba79950cf375b2c6722694000728483242da78ae2f3d704ca324604495c54e [2024-11-10 05:53:09,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:53:09,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:53:09,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:53:09,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:53:09,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:53:09,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i [2024-11-10 05:53:11,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:53:11,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:53:11,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i [2024-11-10 05:53:11,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ae5467b/0d8c31ccfeea439ea48104fc3337f31c/FLAG24c9264b7 [2024-11-10 05:53:11,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ae5467b/0d8c31ccfeea439ea48104fc3337f31c [2024-11-10 05:53:11,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:53:11,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:53:11,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:53:11,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:53:11,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:53:11,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72170bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11, skipping insertion in model container [2024-11-10 05:53:11,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:53:11,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i[919,932] [2024-11-10 05:53:11,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:53:11,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:53:11,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i[919,932] [2024-11-10 05:53:11,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:53:11,819 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:53:11,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11 WrapperNode [2024-11-10 05:53:11,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:53:11,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:53:11,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:53:11,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:53:11,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,901 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-11-10 05:53:11,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:53:11,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:53:11,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:53:11,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:53:11,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,962 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-10 05:53:11,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:11,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:12,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:12,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:53:12,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:53:12,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:53:12,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:53:12,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (1/1) ... [2024-11-10 05:53:12,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:53:12,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:53:12,050 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-10 05:53:12,053 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-10 05:53:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:53:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:53:12,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:53:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:53:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:53:12,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:53:12,214 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:53:12,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:53:12,718 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 05:53:12,719 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:53:12,750 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:53:12,750 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:53:12,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:12 BoogieIcfgContainer [2024-11-10 05:53:12,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:53:12,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:53:12,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:53:12,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:53:12,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:53:11" (1/3) ... [2024-11-10 05:53:12,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc4c025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:12, skipping insertion in model container [2024-11-10 05:53:12,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:11" (2/3) ... [2024-11-10 05:53:12,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc4c025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:12, skipping insertion in model container [2024-11-10 05:53:12,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:12" (3/3) ... [2024-11-10 05:53:12,759 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i [2024-11-10 05:53:12,777 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:53:12,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:53:12,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:53:12,867 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;@7ea4ffc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:53:12,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:53:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 75 states have internal predecessors, (106), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 05:53:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 05:53:12,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:12,894 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:12,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:12,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash -200776991, now seen corresponding path program 1 times [2024-11-10 05:53:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148333852] [2024-11-10 05:53:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148333852] [2024-11-10 05:53:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148333852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:53:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836884697] [2024-11-10 05:53:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:53:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:53:13,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:53:13,574 INFO L87 Difference]: Start difference. First operand has 112 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 75 states have internal predecessors, (106), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 05:53:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:13,627 INFO L93 Difference]: Finished difference Result 216 states and 380 transitions. [2024-11-10 05:53:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:53:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 224 [2024-11-10 05:53:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:13,643 INFO L225 Difference]: With dead ends: 216 [2024-11-10 05:53:13,643 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 05:53:13,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-10 05:53:13,651 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:13,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:53:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 05:53:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-10 05:53:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 05:53:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2024-11-10 05:53:13,721 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 167 transitions. Word has length 224 [2024-11-10 05:53:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:13,725 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 167 transitions. [2024-11-10 05:53:13,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 05:53:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 167 transitions. [2024-11-10 05:53:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 05:53:13,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:13,733 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:13,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:53:13,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:13,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1775907523, now seen corresponding path program 1 times [2024-11-10 05:53:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716094136] [2024-11-10 05:53:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716094136] [2024-11-10 05:53:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716094136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:53:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706062721] [2024-11-10 05:53:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:53:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:53:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:53:14,418 INFO L87 Difference]: Start difference. First operand 107 states and 167 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:14,709 INFO L93 Difference]: Finished difference Result 315 states and 495 transitions. [2024-11-10 05:53:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:53:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-10 05:53:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:14,714 INFO L225 Difference]: With dead ends: 315 [2024-11-10 05:53:14,714 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 05:53:14,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-10 05:53:14,720 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 98 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:14,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 393 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:53:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 05:53:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2024-11-10 05:53:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 134 states have internal predecessors, (185), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 325 transitions. [2024-11-10 05:53:14,772 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 325 transitions. Word has length 224 [2024-11-10 05:53:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:14,773 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 325 transitions. [2024-11-10 05:53:14,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 325 transitions. [2024-11-10 05:53:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 05:53:14,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:14,783 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:14,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:53:14,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:14,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 633613382, now seen corresponding path program 1 times [2024-11-10 05:53:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833070533] [2024-11-10 05:53:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833070533] [2024-11-10 05:53:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833070533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:53:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960323978] [2024-11-10 05:53:15,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:15,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:53:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:53:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:53:15,177 INFO L87 Difference]: Start difference. First operand 207 states and 325 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:15,278 INFO L93 Difference]: Finished difference Result 463 states and 734 transitions. [2024-11-10 05:53:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:53:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-10 05:53:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:15,287 INFO L225 Difference]: With dead ends: 463 [2024-11-10 05:53:15,287 INFO L226 Difference]: Without dead ends: 259 [2024-11-10 05:53:15,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 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-10 05:53:15,290 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 42 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:15,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 324 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:53:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-10 05:53:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 211. [2024-11-10 05:53:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 138 states have internal predecessors, (191), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 331 transitions. [2024-11-10 05:53:15,316 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 331 transitions. Word has length 225 [2024-11-10 05:53:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:15,317 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 331 transitions. [2024-11-10 05:53:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 331 transitions. [2024-11-10 05:53:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 05:53:15,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:15,321 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:53:15,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:15,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash 807504346, now seen corresponding path program 1 times [2024-11-10 05:53:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460707616] [2024-11-10 05:53:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460707616] [2024-11-10 05:53:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460707616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:15,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:53:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819517906] [2024-11-10 05:53:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:53:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:53:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:53:15,662 INFO L87 Difference]: Start difference. First operand 211 states and 331 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 05:53:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:15,902 INFO L93 Difference]: Finished difference Result 423 states and 663 transitions. [2024-11-10 05:53:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:53:15,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2024-11-10 05:53:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:15,905 INFO L225 Difference]: With dead ends: 423 [2024-11-10 05:53:15,906 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 05:53:15,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 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-10 05:53:15,907 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 123 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:15,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 528 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:53:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 05:53:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-10 05:53:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 330 transitions. [2024-11-10 05:53:15,928 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 330 transitions. Word has length 226 [2024-11-10 05:53:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:15,929 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 330 transitions. [2024-11-10 05:53:15,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 05:53:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 330 transitions. [2024-11-10 05:53:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 05:53:15,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:15,932 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:15,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:53:15,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash 398680121, now seen corresponding path program 1 times [2024-11-10 05:53:15,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:15,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206082518] [2024-11-10 05:53:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:16,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206082518] [2024-11-10 05:53:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206082518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:53:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890358620] [2024-11-10 05:53:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:53:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:53:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:53:16,384 INFO L87 Difference]: Start difference. First operand 211 states and 330 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 05:53:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:16,782 INFO L93 Difference]: Finished difference Result 330 states and 510 transitions. [2024-11-10 05:53:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:53:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2024-11-10 05:53:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:16,786 INFO L225 Difference]: With dead ends: 330 [2024-11-10 05:53:16,787 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 05:53:16,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:53:16,790 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 258 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:16,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 665 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:53:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 05:53:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2024-11-10 05:53:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 329 transitions. [2024-11-10 05:53:16,830 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 329 transitions. Word has length 226 [2024-11-10 05:53:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:16,831 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 329 transitions. [2024-11-10 05:53:16,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 05:53:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2024-11-10 05:53:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 05:53:16,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:16,837 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:16,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:53:16,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 427309272, now seen corresponding path program 1 times [2024-11-10 05:53:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590642378] [2024-11-10 05:53:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590642378] [2024-11-10 05:53:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590642378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:53:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081979069] [2024-11-10 05:53:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:17,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:53:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:17,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:53:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:53:17,085 INFO L87 Difference]: Start difference. First operand 211 states and 329 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:17,139 INFO L93 Difference]: Finished difference Result 413 states and 647 transitions. [2024-11-10 05:53:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:53:17,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-10 05:53:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:17,142 INFO L225 Difference]: With dead ends: 413 [2024-11-10 05:53:17,143 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 05:53:17,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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-10 05:53:17,144 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:17,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:53:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 05:53:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 190. [2024-11-10 05:53:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 117 states have internal predecessors, (154), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 294 transitions. [2024-11-10 05:53:17,166 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 294 transitions. Word has length 226 [2024-11-10 05:53:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:17,167 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 294 transitions. [2024-11-10 05:53:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 294 transitions. [2024-11-10 05:53:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 05:53:17,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:17,171 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:17,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:53:17,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:17,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1343442104, now seen corresponding path program 1 times [2024-11-10 05:53:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336235640] [2024-11-10 05:53:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:53:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:53:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:53:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:53:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:53:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:53:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:53:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:53:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:53:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:53:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:53:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:53:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:53:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:53:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:53:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:53:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:53:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:53:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:53:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:53:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:53:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:53:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 05:53:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 05:53:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 05:53:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:53:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:53:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:53:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 05:53:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:53:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 05:53:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:53:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 05:53:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:53:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 05:53:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-10 05:53:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:17,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336235640] [2024-11-10 05:53:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336235640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:53:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733523811] [2024-11-10 05:53:17,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:17,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:53:17,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:53:17,916 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-10 05:53:17,917 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-10 05:53:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:18,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:53:18,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:53:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1222 proven. 48 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-10 05:53:18,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:53:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-10 05:53:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733523811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:53:18,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:53:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 05:53:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404085687] [2024-11-10 05:53:18,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:53:18,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:53:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:53:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:53:18,689 INFO L87 Difference]: Start difference. First operand 190 states and 294 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-10 05:53:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:19,037 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2024-11-10 05:53:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:53:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 226 [2024-11-10 05:53:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:19,040 INFO L225 Difference]: With dead ends: 311 [2024-11-10 05:53:19,041 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 05:53:19,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 517 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:53:19,042 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 188 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:19,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 257 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:53:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 05:53:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2024-11-10 05:53:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.2601626016260163) internal successors, (155), 123 states have internal predecessors, (155), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 295 transitions. [2024-11-10 05:53:19,073 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 295 transitions. Word has length 226 [2024-11-10 05:53:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:19,073 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 295 transitions. [2024-11-10 05:53:19,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-10 05:53:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 295 transitions. [2024-11-10 05:53:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 05:53:19,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:19,077 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:19,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 05:53:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:53:19,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1073478757, now seen corresponding path program 1 times [2024-11-10 05:53:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601576225] [2024-11-10 05:53:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:53:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083591935] [2024-11-10 05:53:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:53:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:53:19,473 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-10 05:53:19,474 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-10 05:53:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:19,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 05:53:19,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:53:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 718 proven. 84 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2024-11-10 05:53:20,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:53:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:53:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601576225] [2024-11-10 05:53:20,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 05:53:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083591935] [2024-11-10 05:53:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083591935] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:53:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:53:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-10 05:53:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915012929] [2024-11-10 05:53:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:20,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:53:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:53:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:53:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:53:20,359 INFO L87 Difference]: Start difference. First operand 198 states and 295 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:20,507 INFO L93 Difference]: Finished difference Result 368 states and 531 transitions. [2024-11-10 05:53:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:53:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-10 05:53:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:20,510 INFO L225 Difference]: With dead ends: 368 [2024-11-10 05:53:20,511 INFO L226 Difference]: Without dead ends: 256 [2024-11-10 05:53:20,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:53:20,512 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 164 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:20,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 281 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:53:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-10 05:53:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2024-11-10 05:53:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 133 states have internal predecessors, (166), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2024-11-10 05:53:20,544 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 228 [2024-11-10 05:53:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:20,545 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2024-11-10 05:53:20,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2024-11-10 05:53:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 05:53:20,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:20,549 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:20,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:53:20,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 05:53:20,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -862127844, now seen corresponding path program 1 times [2024-11-10 05:53:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:53:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063963715] [2024-11-10 05:53:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:53:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:53:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235347548] [2024-11-10 05:53:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:20,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:53:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:53:20,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:53:20,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 05:53:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:53:21,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:53:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:53:21,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:53:21,261 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:53:21,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:53:21,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 05:53:21,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:53:21,468 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:53:21,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:53:21,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:53:21 BoogieIcfgContainer [2024-11-10 05:53:21,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:53:21,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:53:21,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:53:21,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:53:21,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:12" (3/4) ... [2024-11-10 05:53:21,649 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:53:21,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:53:21,651 INFO L158 Benchmark]: Toolchain (without parser) took 10225.80ms. Allocated memory was 159.4MB in the beginning and 333.4MB in the end (delta: 174.1MB). Free memory was 101.5MB in the beginning and 278.3MB in the end (delta: -176.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:53:21,651 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:53:21,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.92ms. Allocated memory is still 159.4MB. Free memory was 101.5MB in the beginning and 83.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 05:53:21,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.46ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 78.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:53:21,652 INFO L158 Benchmark]: Boogie Preprocessor took 111.25ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 72.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:53:21,653 INFO L158 Benchmark]: IcfgBuilder took 735.65ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 72.5MB in the beginning and 177.1MB in the end (delta: -104.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-10 05:53:21,653 INFO L158 Benchmark]: TraceAbstraction took 8892.98ms. Allocated memory was 230.7MB in the beginning and 333.4MB in the end (delta: 102.8MB). Free memory was 177.1MB in the beginning and 278.3MB in the end (delta: -101.2MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. [2024-11-10 05:53:21,653 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 333.4MB. Free memory is still 278.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:53:21,655 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 119.5MB in the end (delta: 209.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.92ms. Allocated memory is still 159.4MB. Free memory was 101.5MB in the beginning and 83.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.46ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 78.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.25ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 72.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 735.65ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 72.5MB in the beginning and 177.1MB in the end (delta: -104.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8892.98ms. Allocated memory was 230.7MB in the beginning and 333.4MB in the end (delta: 102.8MB). Free memory was 177.1MB in the beginning and 278.3MB in the end (delta: -101.2MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 333.4MB. Free memory is still 278.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 207. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_22 = 100; [L41] unsigned char var_1_23 = 16; [L42] signed long int var_1_24 = -256; [L43] unsigned char var_1_25 = 1; [L44] float var_1_26 = 128.75; [L45] float var_1_27 = 25.02; [L46] float var_1_28 = 3.5; [L47] unsigned char var_1_30 = 25; [L48] signed char var_1_32 = 1; [L49] unsigned char var_1_33 = 200; [L50] unsigned char var_1_34 = 64; [L51] unsigned char var_1_35 = 64; [L52] unsigned char var_1_36 = 8; [L53] unsigned short int var_1_37 = 500; [L54] unsigned char var_1_38 = 32; [L55] unsigned short int var_1_39 = 25; [L56] signed char last_1_var_1_8 = -10; [L57] unsigned char last_1_var_1_15 = 0; [L58] signed long int last_1_var_1_19 = -50; VAL [isInitial=0, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L211] isInitial = 1 [L212] FCALL initially() [L213] COND TRUE 1 [L214] CALL updateLastVariables() [L202] last_1_var_1_8 = var_1_8 [L203] last_1_var_1_15 = var_1_15 [L204] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L214] RET updateLastVariables() [L215] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L146] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L147] var_1_3 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L149] var_1_4 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L150] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L152] var_1_6 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=16, var_1_8=-10, var_1_9=-8] [L153] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=16, var_1_8=-10, var_1_9=-8] [L154] var_1_7 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_8=-10, var_1_9=-8] [L155] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_8=-10, var_1_9=-8] [L156] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=-8] [L156] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=-8] [L157] var_1_9 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] var_1_11 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] var_1_12 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] var_1_16 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] var_1_17 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] var_1_18 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L173] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L174] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L175] var_1_22 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L176] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L177] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_26=515/4, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L178] var_1_26 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L179] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_27=1251/50, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L180] var_1_27 = __VERIFIER_nondet_float() [L181] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L181] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_28=7/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L182] var_1_28 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L183] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L184] var_1_32 = __VERIFIER_nondet_char() [L185] CALL assume_abort_if_not(var_1_32 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L185] RET assume_abort_if_not(var_1_32 >= -128) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L186] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L186] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L187] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L188] var_1_33 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_33 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] RET assume_abort_if_not(var_1_33 >= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L190] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L190] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L191] var_1_34 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L192] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L193] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L194] var_1_35 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_35 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L195] RET assume_abort_if_not(var_1_35 >= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L196] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L197] var_1_36 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L198] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L199] CALL assume_abort_if_not(var_1_36 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L199] RET assume_abort_if_not(var_1_36 <= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L215] RET updateVariables() [L216] CALL step() [L62] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=0, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L63] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L70] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L72] EXPR var_1_22 >> var_1_1 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L72] EXPR var_1_1 & (var_1_22 >> var_1_1) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L72] COND FALSE !(var_1_19 >= (var_1_1 & (var_1_22 >> var_1_1))) [L75] EXPR var_1_1 ^ var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L75] COND FALSE !(var_1_19 > (var_1_1 ^ var_1_22)) [L79] COND FALSE !((- var_1_7) < (var_1_1 * var_1_4)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L82] COND FALSE !(var_1_1 <= -1) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L85] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L86] COND FALSE !(var_1_19 >= (-128 & var_1_10)) [L91] var_1_25 = var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L93] var_1_38 = var_1_34 [L94] var_1_39 = var_1_8 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L95] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L102] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L103] COND FALSE !(var_1_3 != var_1_6) [L110] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L112] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L115] COND TRUE ! var_1_15 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L116] COND TRUE (var_1_13 % var_1_32) <= var_1_10 [L117] var_1_30 = (var_1_33 - ((((var_1_34) > ((var_1_35 - var_1_36))) ? (var_1_34) : ((var_1_35 - var_1_36))))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=8, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L121] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L122] COND FALSE !(((((var_1_1) > (var_1_19)) ? (var_1_1) : (var_1_19))) > var_1_32) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L129] unsigned short int stepLocal_4 = var_1_1; [L130] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L131] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, stepLocal_2=-18242, stepLocal_3=128, stepLocal_4=0, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L132] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, stepLocal_3=128, stepLocal_4=0, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=-50, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L138] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=14780, stepLocal_3=128, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L216] RET step() [L217] CALL, EXPR property() [L207-L208] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18242, var_1_11=270336, var_1_12=-131072, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=-47293, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=10, var_1_22=1, var_1_23=1, var_1_24=-256, var_1_25=1, var_1_30=64, var_1_32=96, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=-10, var_1_4=0, var_1_7=0, var_1_8=-10, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 9, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 907 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 873 mSDsluCounter, 2909 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1681 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 796 IncrementalHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 1228 mSDtfsCounter, 796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1470 GetRequests, 1431 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 138 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2715 NumberOfCodeBlocks, 2715 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2474 ConstructedInterpolants, 6 QuantifiedInterpolants, 5158 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1026 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 25952/26180 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-10 05:53:21,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.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 9cba79950cf375b2c6722694000728483242da78ae2f3d704ca324604495c54e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:53:23,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:53:24,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:53:24,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:53:24,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:53:24,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:53:24,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:53:24,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:53:24,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:53:24,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:53:24,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:53:24,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:53:24,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:53:24,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:53:24,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:53:24,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:53:24,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:53:24,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:53:24,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:53:24,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:53:24,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:53:24,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:53:24,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:53:24,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:53:24,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:53:24,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:53:24,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:53:24,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:53:24,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:53:24,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:53:24,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:53:24,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:53:24,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:53:24,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:53:24,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:53:24,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:53:24,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:53:24,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:53:24,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:53:24,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:53:24,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:53:24,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:53:24,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:53:24,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:53:24,126 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 -> 9cba79950cf375b2c6722694000728483242da78ae2f3d704ca324604495c54e [2024-11-10 05:53:24,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:53:24,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:53:24,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:53:24,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:53:24,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:53:24,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i [2024-11-10 05:53:26,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:53:26,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:53:26,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i [2024-11-10 05:53:26,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ba7bc6/35fcd0bfb777417d8b3208618937e888/FLAG514af5b89 [2024-11-10 05:53:26,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ba7bc6/35fcd0bfb777417d8b3208618937e888 [2024-11-10 05:53:26,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:53:26,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:53:26,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:53:26,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:53:26,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:53:26,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b2e623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26, skipping insertion in model container [2024-11-10 05:53:26,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:53:26,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i[919,932] [2024-11-10 05:53:26,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:53:26,681 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:53:26,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i[919,932] [2024-11-10 05:53:26,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:53:26,756 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:53:26,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26 WrapperNode [2024-11-10 05:53:26,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:53:26,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:53:26,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:53:26,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:53:26,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,813 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-11-10 05:53:26,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:53:26,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:53:26,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:53:26,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:53:26,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,848 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-10 05:53:26,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:53:26,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:53:26,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:53:26,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:53:26,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 05:53:26,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:53:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:53:26,916 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-10 05:53:26,919 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-10 05:53:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:53:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:53:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:53:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:53:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:53:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:53:27,096 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:53:27,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:53:28,442 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 05:53:28,443 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:53:28,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:53:28,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:53:28,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:28 BoogieIcfgContainer [2024-11-10 05:53:28,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:53:28,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:53:28,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:53:28,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:53:28,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:53:26" (1/3) ... [2024-11-10 05:53:28,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67351e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:28, skipping insertion in model container [2024-11-10 05:53:28,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (2/3) ... [2024-11-10 05:53:28,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67351e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:28, skipping insertion in model container [2024-11-10 05:53:28,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:28" (3/3) ... [2024-11-10 05:53:28,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-77.i [2024-11-10 05:53:28,491 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:53:28,492 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:53:28,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:53:28,583 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;@3f5f2584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:53:28,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:53:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 05:53:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-10 05:53:28,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:28,608 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:28,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1027108278, now seen corresponding path program 1 times [2024-11-10 05:53:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:53:28,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601919065] [2024-11-10 05:53:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:28,632 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-10 05:53:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:53:28,636 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-10 05:53:28,638 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-10 05:53:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:29,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:53:29,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:53:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:29,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:53:29,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:53:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601919065] [2024-11-10 05:53:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601919065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:53:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521560971] [2024-11-10 05:53:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:53:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:53:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:53:29,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:53:29,151 INFO L87 Difference]: Start difference. First operand has 103 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:29,190 INFO L93 Difference]: Finished difference Result 198 states and 350 transitions. [2024-11-10 05:53:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:53:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-11-10 05:53:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:29,200 INFO L225 Difference]: With dead ends: 198 [2024-11-10 05:53:29,201 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 05:53:29,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 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-10 05:53:29,207 INFO L432 NwaCegarLoop]: 152 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, 152 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-10 05:53:29,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:53:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 05:53:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 05:53:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 05:53:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-10 05:53:29,256 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 222 [2024-11-10 05:53:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:29,258 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-10 05:53:29,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-10 05:53:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-10 05:53:29,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:29,262 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:29,273 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-10 05:53:29,464 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-10 05:53:29,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:29,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2024180631, now seen corresponding path program 1 times [2024-11-10 05:53:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:53:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908701449] [2024-11-10 05:53:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:29,467 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-10 05:53:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:53:29,470 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-10 05:53:29,484 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-10 05:53:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:29,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:53:29,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:53:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:30,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:53:30,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:53:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908701449] [2024-11-10 05:53:30,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908701449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:30,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:30,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:53:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381422271] [2024-11-10 05:53:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:30,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:53:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:53:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:53:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:53:30,574 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:31,127 INFO L93 Difference]: Finished difference Result 287 states and 448 transitions. [2024-11-10 05:53:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:53:31,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-11-10 05:53:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:31,136 INFO L225 Difference]: With dead ends: 287 [2024-11-10 05:53:31,138 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 05:53:31,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 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-10 05:53:31,140 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:31,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 288 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:53:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 05:53:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2024-11-10 05:53:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 292 transitions. [2024-11-10 05:53:31,194 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 292 transitions. Word has length 222 [2024-11-10 05:53:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 292 transitions. [2024-11-10 05:53:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 292 transitions. [2024-11-10 05:53:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-10 05:53:31,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:31,207 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:31,227 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-10 05:53:31,407 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-10 05:53:31,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1759154169, now seen corresponding path program 1 times [2024-11-10 05:53:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:53:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533359251] [2024-11-10 05:53:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:31,411 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-10 05:53:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:53:31,415 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-10 05:53:31,416 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-10 05:53:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:31,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 05:53:31,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:53:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1222 proven. 48 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-10 05:53:31,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:53:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-10 05:53:32,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:53:32,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533359251] [2024-11-10 05:53:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533359251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:53:32,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:53:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 05:53:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968790718] [2024-11-10 05:53:32,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:53:32,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:53:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:53:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:53:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:53:32,376 INFO L87 Difference]: Start difference. First operand 188 states and 292 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-10 05:53:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:33,417 INFO L93 Difference]: Finished difference Result 389 states and 595 transitions. [2024-11-10 05:53:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:53:33,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 223 [2024-11-10 05:53:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:33,421 INFO L225 Difference]: With dead ends: 389 [2024-11-10 05:53:33,422 INFO L226 Difference]: Without dead ends: 204 [2024-11-10 05:53:33,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:53:33,424 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 186 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:33,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 230 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 05:53:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-10 05:53:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2024-11-10 05:53:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 121 states have (on average 1.2314049586776858) internal successors, (149), 121 states have internal predecessors, (149), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 289 transitions. [2024-11-10 05:53:33,460 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 289 transitions. Word has length 223 [2024-11-10 05:53:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:33,460 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 289 transitions. [2024-11-10 05:53:33,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-10 05:53:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 289 transitions. [2024-11-10 05:53:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 05:53:33,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:33,464 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:33,477 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-10 05:53:33,664 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-10 05:53:33,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash -272738596, now seen corresponding path program 1 times [2024-11-10 05:53:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:53:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835663883] [2024-11-10 05:53:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:33,667 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-10 05:53:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:53:33,668 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-10 05:53:33,669 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-10 05:53:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:33,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:53:33,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:53:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 05:53:33,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:53:33,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:53:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835663883] [2024-11-10 05:53:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835663883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:53:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:53:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:53:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036192911] [2024-11-10 05:53:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:53:33,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:53:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:53:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:53:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:53:33,978 INFO L87 Difference]: Start difference. First operand 196 states and 289 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:53:34,488 INFO L93 Difference]: Finished difference Result 383 states and 566 transitions. [2024-11-10 05:53:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:53:34,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-10 05:53:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:53:34,506 INFO L225 Difference]: With dead ends: 383 [2024-11-10 05:53:34,506 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 05:53:34,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 223 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-10 05:53:34,510 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 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.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:53:34,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:53:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 05:53:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2024-11-10 05:53:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 100 states have (on average 1.17) internal successors, (117), 100 states have internal predecessors, (117), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 05:53:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2024-11-10 05:53:34,553 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 225 [2024-11-10 05:53:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:53:34,554 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2024-11-10 05:53:34,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 05:53:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2024-11-10 05:53:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 05:53:34,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:53:34,557 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:53:34,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 05:53:34,758 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-10 05:53:34,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:53:34,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:53:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash 672023387, now seen corresponding path program 1 times [2024-11-10 05:53:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:53:34,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544873989] [2024-11-10 05:53:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:53:34,760 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-10 05:53:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:53:34,764 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-10 05:53:34,766 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-10 05:53:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:53:35,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 05:53:35,121 INFO L278 TraceCheckSpWp]: Computing forward predicates...