./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_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-ps-ci_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 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:03:49,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:03:49,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:03:49,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:03:49,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:03:49,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:03:49,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:03:49,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:03:49,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:03:49,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:03:49,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:03:49,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:03:49,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:03:49,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:03:49,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:03:49,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:03:49,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:03:49,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:03:49,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:03:49,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:03:49,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:03:49,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:03:49,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:03:49,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:03:49,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:03:49,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:03:49,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:03:49,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:03:49,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:03:49,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:03:49,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:03:49,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:03:49,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:03:49,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:03:49,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:03:49,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:03:49,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:03:49,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:03:49,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:03:49,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:03:49,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:03:49,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:03:49,805 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 -> 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 [2024-11-10 06:03:50,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:03:50,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:03:50,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:03:50,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:03:50,116 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:03:50,117 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-ps-ci_file-77.i [2024-11-10 06:03:51,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:03:51,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:03:51,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-10 06:03:51,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9407d2ce8/5e6616f8be4f4554b48f4d3933c9152f/FLAG2ae1dac77 [2024-11-10 06:03:52,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9407d2ce8/5e6616f8be4f4554b48f4d3933c9152f [2024-11-10 06:03:52,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:03:52,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:03:52,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:03:52,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:03:52,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:03:52,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d5dd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52, skipping insertion in model container [2024-11-10 06:03:52,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:03:52,495 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-ps-ci_file-77.i[919,932] [2024-11-10 06:03:52,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:03:52,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:03:52,602 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-ps-ci_file-77.i[919,932] [2024-11-10 06:03:52,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:03:52,665 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:03:52,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52 WrapperNode [2024-11-10 06:03:52,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:03:52,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:03:52,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:03:52,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:03:52,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,735 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2024-11-10 06:03:52,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:03:52,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:03:52,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:03:52,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:03:52,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,827 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 06:03:52,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:03:52,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:03:52,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:03:52,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:03:52,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (1/1) ... [2024-11-10 06:03:52,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:03:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:52,911 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 06:03:52,916 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 06:03:52,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:03:52,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:03:52,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:03:52,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:03:52,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:03:52,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:03:53,074 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:03:53,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:03:53,602 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 06:03:53,602 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:03:53,636 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:03:53,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:03:53,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:53 BoogieIcfgContainer [2024-11-10 06:03:53,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:03:53,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:03:53,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:03:53,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:03:53,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:03:52" (1/3) ... [2024-11-10 06:03:53,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7118eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:53, skipping insertion in model container [2024-11-10 06:03:53,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:52" (2/3) ... [2024-11-10 06:03:53,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7118eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:53, skipping insertion in model container [2024-11-10 06:03:53,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:53" (3/3) ... [2024-11-10 06:03:53,654 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-10 06:03:53,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:03:53,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:03:53,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:03:53,747 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;@76d6813, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:03:53,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:03:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:03:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 06:03:53,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:53,768 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:53,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1538043479, now seen corresponding path program 1 times [2024-11-10 06:03:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047653220] [2024-11-10 06:03:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:03:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:03:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:03:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:03:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:03:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:03:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:03:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:03:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:03:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:03:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:03:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:03:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:03:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:03:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:03:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:03:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:03:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:03:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047653220] [2024-11-10 06:03:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047653220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:03:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702035834] [2024-11-10 06:03:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:03:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:03:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:03:54,427 INFO L87 Difference]: Start difference. First operand has 105 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:03:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:54,500 INFO L93 Difference]: Finished difference Result 202 states and 357 transitions. [2024-11-10 06:03:54,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:03:54,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-11-10 06:03:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:54,514 INFO L225 Difference]: With dead ends: 202 [2024-11-10 06:03:54,514 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 06:03:54,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 06:03:54,525 INFO L432 NwaCegarLoop]: 154 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, 154 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 06:03:54,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 06:03:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 06:03:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:03:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2024-11-10 06:03:54,578 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 205 [2024-11-10 06:03:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2024-11-10 06:03:54,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:03:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2024-11-10 06:03:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 06:03:54,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:54,584 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:54,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:03:54,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2106956042, now seen corresponding path program 1 times [2024-11-10 06:03:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446903556] [2024-11-10 06:03:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:03:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:03:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:03:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:03:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:03:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:03:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:03:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:03:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:03:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:03:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:03:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:03:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:03:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:03:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:03:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:03:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:03:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:03:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446903556] [2024-11-10 06:03:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446903556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:55,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:03:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092187648] [2024-11-10 06:03:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:55,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:03:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:03:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:03:55,325 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:03:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:55,789 INFO L93 Difference]: Finished difference Result 303 states and 474 transitions. [2024-11-10 06:03:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:03:55,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-11-10 06:03:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:55,799 INFO L225 Difference]: With dead ends: 303 [2024-11-10 06:03:55,800 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 06:03:55,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 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 06:03:55,805 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 252 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:55,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 653 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:03:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 06:03:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2024-11-10 06:03:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:03:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2024-11-10 06:03:55,861 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 205 [2024-11-10 06:03:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:55,865 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2024-11-10 06:03:55,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:03:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2024-11-10 06:03:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 06:03:55,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:55,869 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:55,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:03:55,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2078326891, now seen corresponding path program 1 times [2024-11-10 06:03:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092391052] [2024-11-10 06:03:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:03:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:03:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:03:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:03:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:03:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:03:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:03:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:03:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:03:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:03:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:03:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:03:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:03:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:03:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:03:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:03:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:03:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:03:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092391052] [2024-11-10 06:03:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092391052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:03:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369735993] [2024-11-10 06:03:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:56,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:03:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:03:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:03:56,140 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:03:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:56,188 INFO L93 Difference]: Finished difference Result 377 states and 601 transitions. [2024-11-10 06:03:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:03:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 06:03:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:56,193 INFO L225 Difference]: With dead ends: 377 [2024-11-10 06:03:56,193 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 06:03:56,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 06:03:56,196 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:56,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 06:03:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 99. [2024-11-10 06:03:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:03:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2024-11-10 06:03:56,222 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 205 [2024-11-10 06:03:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:56,223 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2024-11-10 06:03:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:03:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2024-11-10 06:03:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 06:03:56,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:56,230 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:03:56,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1162194059, now seen corresponding path program 1 times [2024-11-10 06:03:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618791810] [2024-11-10 06:03:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:03:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:03:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:03:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:03:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:03:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:03:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:03:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:03:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:03:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:03:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:03:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:03:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:03:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:03:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:03:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:03:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:03:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-10 06:03:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618791810] [2024-11-10 06:03:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618791810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:03:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720348716] [2024-11-10 06:03:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:56,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:56,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:56,808 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 06:03:56,810 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 06:03:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:56,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 06:03:56,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-10 06:03:57,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:03:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 117 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-10 06:03:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720348716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:03:58,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:03:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2024-11-10 06:03:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367240470] [2024-11-10 06:03:58,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:03:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 06:03:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:58,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 06:03:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-10 06:03:58,310 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-10 06:03:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:58,939 INFO L93 Difference]: Finished difference Result 215 states and 322 transitions. [2024-11-10 06:03:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 06:03:58,941 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 205 [2024-11-10 06:03:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:58,942 INFO L225 Difference]: With dead ends: 215 [2024-11-10 06:03:58,943 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 06:03:58,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-11-10 06:03:58,948 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 340 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:58,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 232 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:03:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 06:03:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-11-10 06:03:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:03:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-10 06:03:58,973 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 205 [2024-11-10 06:03:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:58,974 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-10 06:03:58,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-11-10 06:03:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-10 06:03:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 06:03:58,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:58,978 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:59,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:03:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:59,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 452540016, now seen corresponding path program 1 times [2024-11-10 06:03:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422968925] [2024-11-10 06:03:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:03:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:03:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:03:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:03:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:03:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:03:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:03:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:03:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:03:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 06:03:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:03:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 06:03:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:03:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:03:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:03:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:03:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:03:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:03:59,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422968925] [2024-11-10 06:03:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422968925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:59,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:03:59,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902851126] [2024-11-10 06:03:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:59,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:03:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:03:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:03:59,561 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:03:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:59,642 INFO L93 Difference]: Finished difference Result 317 states and 457 transitions. [2024-11-10 06:03:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:03:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-10 06:03:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:59,645 INFO L225 Difference]: With dead ends: 317 [2024-11-10 06:03:59,646 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 06:03:59,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 06:03:59,647 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 71 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:59,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 06:03:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2024-11-10 06:03:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 123 states have (on average 1.2276422764227641) internal successors, (151), 123 states have internal predecessors, (151), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:03:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 279 transitions. [2024-11-10 06:03:59,712 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 279 transitions. Word has length 207 [2024-11-10 06:03:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:59,713 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 279 transitions. [2024-11-10 06:03:59,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:03:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 279 transitions. [2024-11-10 06:03:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-10 06:03:59,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:59,717 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:03:59,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:03:59,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:59,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1544012767, now seen corresponding path program 1 times [2024-11-10 06:03:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42014199] [2024-11-10 06:03:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:03:59,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415684290] [2024-11-10 06:03:59,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:59,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:59,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:59,893 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 06:03:59,895 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 06:04:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:04:00,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:04:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:04:00,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:04:00,366 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:04:00,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:04:00,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 06:04:00,569 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,SelfDestructingSolverStorable5 [2024-11-10 06:04:00,572 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 06:04:00,740 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:04:00,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:04:00 BoogieIcfgContainer [2024-11-10 06:04:00,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:04:00,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:04:00,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:04:00,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:04:00,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:53" (3/4) ... [2024-11-10 06:04:00,748 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:04:00,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:04:00,749 INFO L158 Benchmark]: Toolchain (without parser) took 8472.10ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 125.6MB in the beginning and 168.4MB in the end (delta: -42.8MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-11-10 06:04:00,750 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 195.0MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:04:00,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.92ms. Allocated memory is still 195.0MB. Free memory was 125.6MB in the beginning and 108.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:04:00,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.84ms. Allocated memory is still 195.0MB. Free memory was 108.1MB in the beginning and 103.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:04:00,750 INFO L158 Benchmark]: Boogie Preprocessor took 133.86ms. Allocated memory is still 195.0MB. Free memory was 103.2MB in the beginning and 165.0MB in the end (delta: -61.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-10 06:04:00,751 INFO L158 Benchmark]: IcfgBuilder took 769.41ms. Allocated memory is still 195.0MB. Free memory was 165.0MB in the beginning and 131.6MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 06:04:00,751 INFO L158 Benchmark]: TraceAbstraction took 7100.78ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 130.5MB in the beginning and 168.4MB in the end (delta: -38.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2024-11-10 06:04:00,751 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 302.0MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:04:00,753 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.21ms. Allocated memory is still 195.0MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.92ms. Allocated memory is still 195.0MB. Free memory was 125.6MB in the beginning and 108.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.84ms. Allocated memory is still 195.0MB. Free memory was 108.1MB in the beginning and 103.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.86ms. Allocated memory is still 195.0MB. Free memory was 103.2MB in the beginning and 165.0MB in the end (delta: -61.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * IcfgBuilder took 769.41ms. Allocated memory is still 195.0MB. Free memory was 165.0MB in the beginning and 131.6MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7100.78ms. Allocated memory was 195.0MB in the beginning and 302.0MB in the end (delta: 107.0MB). Free memory was 130.5MB in the beginning and 168.4MB in the end (delta: -38.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 302.0MB. Free memory is still 168.4MB. 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 198. 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] unsigned char var_1_30 = 25; [L45] signed char var_1_32 = 1; [L46] unsigned char var_1_33 = 200; [L47] unsigned char var_1_34 = 64; [L48] unsigned char var_1_35 = 64; [L49] unsigned char var_1_36 = 8; [L50] unsigned short int var_1_37 = 500; [L51] unsigned char var_1_38 = 32; [L52] unsigned short int var_1_39 = 25; [L53] signed char last_1_var_1_8 = -10; [L54] unsigned char last_1_var_1_15 = 0; [L55] 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_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] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_8 = var_1_8 [L194] last_1_var_1_15 = var_1_15 [L195] 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_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] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_float() [L143] 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_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_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] [L143] 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_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] [L144] var_1_3 = __VERIFIER_nondet_float() [L145] 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_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_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] [L145] 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_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] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] 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_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=1, 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_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=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L147] 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_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=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] 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_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=1, 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_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=1, 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_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_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=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L149] var_1_6 = __VERIFIER_nondet_float() [L150] 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_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=1, 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_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=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L150] 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_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=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] var_1_7 = __VERIFIER_nondet_ushort() [L152] 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_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=1, 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_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=1, var_1_8=-10, var_1_9=-8] [L152] 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_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=1, var_1_8=-10, var_1_9=-8] [L153] 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_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=1, var_1_7=1, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=-8] [L153] 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=-8] [L154] var_1_9 = __VERIFIER_nondet_char() [L155] 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L155] 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L156] 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L156] 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L157] var_1_11 = __VERIFIER_nondet_ushort() [L158] 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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L158] 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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L159] 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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L159] 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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L160] var_1_12 = __VERIFIER_nondet_ushort() [L161] 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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L161] 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=-57345, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L162] 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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L162] 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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L163] var_1_16 = __VERIFIER_nondet_ushort() [L164] 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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L164] 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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L165] 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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L165] 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=-57345, var_1_12=-63678, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L166] var_1_17 = __VERIFIER_nondet_ushort() [L167] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L167] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L168] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L168] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L169] var_1_18 = __VERIFIER_nondet_uchar() [L170] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L170] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L171] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L171] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L172] var_1_22 = __VERIFIER_nondet_uchar() [L173] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L173] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, 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_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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L174] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L174] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L175] var_1_32 = __VERIFIER_nondet_char() [L176] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L176] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L177] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L177] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L178] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L178] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L179] var_1_33 = __VERIFIER_nondet_uchar() [L180] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L180] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L181] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L181] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L182] var_1_34 = __VERIFIER_nondet_uchar() [L183] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L183] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L184] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L184] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L185] var_1_35 = __VERIFIER_nondet_uchar() [L186] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L186] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L187] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L187] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L188] var_1_36 = __VERIFIER_nondet_uchar() [L189] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L189] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L190] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L190] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L206] RET updateVariables() [L207] CALL step() [L59] COND FALSE !(var_1_7 <= -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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L62] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L63] EXPR var_1_22 >> 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L63] EXPR var_1_8 & (var_1_22 >> 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L63] COND TRUE var_1_13 >= (var_1_8 & (var_1_22 >> var_1_4)) [L64] var_1_24 = (var_1_22 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L70] COND TRUE var_1_16 >= (-128 & var_1_11) 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L71] COND FALSE !((((((var_1_3) > (var_1_3)) ? (var_1_3) : (var_1_3))) <= var_1_3) && var_1_18) 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L77] COND FALSE !(\read(var_1_18)) 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L80] 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, var_1_10=8, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L81] COND TRUE (var_1_9 % var_1_32) <= var_1_11 [L82] 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, var_1_10=8, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L86] COND FALSE !(((((var_1_1) > (var_1_10)) ? (var_1_1) : (var_1_10))) > var_1_32) 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L93] var_1_38 = var_1_34 [L94] var_1_39 = var_1_11 [L95] 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=1, var_1_10=8, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L96] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L103] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=-10, var_1_9=1] [L105] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L106] var_1_8 = var_1_9 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L108] 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=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L115] 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=16640, var_1_10=8, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L116] COND FALSE !(var_1_3 != var_1_6) [L123] 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=16640, var_1_10=8, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L125] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L126] unsigned short int stepLocal_4 = var_1_1; [L127] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L128] 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=16640, stepLocal_2=-16383, stepLocal_3=130, stepLocal_4=1, var_1_10=16383, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L129] 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=16640, stepLocal_3=130, stepLocal_4=1, var_1_10=16383, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=-50, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L134] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L135] 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=16640, stepLocal_3=130, var_1_10=16383, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] 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=16383, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [L208] RET, EXPR property() [L208] 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=16383, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] [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=16383, var_1_11=-57345, var_1_12=-63678, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=81919, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=8, 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=-57345, var_1_4=1, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 663 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 1608 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 911 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 697 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 800 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 122 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1648 NumberOfCodeBlocks, 1648 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1430 ConstructedInterpolants, 0 QuantifiedInterpolants, 4216 SizeOfPredicates, 4 NumberOfNonLiveVariables, 473 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 13618/13888 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 06:04:00,792 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-ps-ci_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 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:04:03,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:04:03,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:04:03,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:04:03,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:04:03,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:04:03,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:04:03,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:04:03,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:04:03,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:04:03,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:04:03,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:04:03,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:04:03,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:04:03,324 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:04:03,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:04:03,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:04:03,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:04:03,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:04:03,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:04:03,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:04:03,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:04:03,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:04:03,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:04:03,328 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:04:03,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:04:03,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:04:03,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:04:03,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:04:03,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:04:03,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:04:03,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:04:03,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:04:03,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:04:03,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:04:03,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:04:03,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:04:03,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:04:03,332 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:04:03,332 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:04:03,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:04:03,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:04:03,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:04:03,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:04:03,333 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 -> 90d2ecb269ea751b29d0bf6d98b8e81014506e0b0b654fb9f2949f1dc1fe64a3 [2024-11-10 06:04:03,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:04:03,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:04:03,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:04:03,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:04:03,687 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:04:03,688 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-ps-ci_file-77.i [2024-11-10 06:04:05,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:04:05,603 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:04:05,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-10 06:04:05,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fc4b57d/f937a02b62c84eae9a8748ffcd1a7173/FLAGa4a5d3ef6 [2024-11-10 06:04:05,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fc4b57d/f937a02b62c84eae9a8748ffcd1a7173 [2024-11-10 06:04:05,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:04:05,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:04:05,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:04:05,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:04:05,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:04:05,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:04:05" (1/1) ... [2024-11-10 06:04:05,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421e7bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:05, skipping insertion in model container [2024-11-10 06:04:05,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:04:05" (1/1) ... [2024-11-10 06:04:05,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:04:05,883 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-ps-ci_file-77.i[919,932] [2024-11-10 06:04:05,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:04:06,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:04:06,063 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-ps-ci_file-77.i[919,932] [2024-11-10 06:04:06,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:04:06,185 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:04:06,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06 WrapperNode [2024-11-10 06:04:06,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:04:06,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:04:06,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:04:06,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:04:06,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,254 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-10 06:04:06,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:04:06,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:04:06,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:04:06,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:04:06,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,301 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 06:04:06,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:04:06,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:04:06,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:04:06,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:04:06,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (1/1) ... [2024-11-10 06:04:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:04:06,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:04:06,372 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 06:04:06,380 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 06:04:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:04:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:04:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:04:06,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:04:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:04:06,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:04:06,548 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:04:06,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:04:07,860 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 06:04:07,864 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:04:07,884 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:04:07,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:04:07,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:04:07 BoogieIcfgContainer [2024-11-10 06:04:07,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:04:07,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:04:07,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:04:07,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:04:07,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:04:05" (1/3) ... [2024-11-10 06:04:07,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5539e7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:04:07, skipping insertion in model container [2024-11-10 06:04:07,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:06" (2/3) ... [2024-11-10 06:04:07,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5539e7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:04:07, skipping insertion in model container [2024-11-10 06:04:07,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:04:07" (3/3) ... [2024-11-10 06:04:07,899 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-77.i [2024-11-10 06:04:07,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:04:07,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:04:08,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:04:08,014 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;@5c9a27aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:04:08,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:04:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:04:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 06:04:08,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:08,045 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:04:08,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1320780245, now seen corresponding path program 1 times [2024-11-10 06:04:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639330598] [2024-11-10 06:04:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:08,073 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 06:04:08,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:08,077 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 06:04:08,078 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 06:04:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:08,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:04:08,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-11-10 06:04:08,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:04:08,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:04:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639330598] [2024-11-10 06:04:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639330598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:04:08,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:04:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:04:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219902180] [2024-11-10 06:04:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:04:08,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:04:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:04:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:04:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:04:08,536 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:04:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:04:08,568 INFO L93 Difference]: Finished difference Result 184 states and 327 transitions. [2024-11-10 06:04:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:04:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-10 06:04:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:04:08,581 INFO L225 Difference]: With dead ends: 184 [2024-11-10 06:04:08,581 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 06:04:08,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 06:04:08,590 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:04:08,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:04:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 06:04:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 06:04:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:04:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-10 06:04:08,643 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 203 [2024-11-10 06:04:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:04:08,643 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-10 06:04:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:04:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-10 06:04:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 06:04:08,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:08,648 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:04:08,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:04:08,849 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 06:04:08,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:08,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1124586122, now seen corresponding path program 1 times [2024-11-10 06:04:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272971892] [2024-11-10 06:04:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:08,853 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 06:04:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:08,854 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 06:04:08,856 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 06:04:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:09,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:04:09,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2024-11-10 06:04:09,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:04:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-10 06:04:09,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:04:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272971892] [2024-11-10 06:04:09,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272971892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:04:09,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:04:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 06:04:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813008857] [2024-11-10 06:04:09,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:04:09,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:04:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:04:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:04:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:04:09,880 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 06:04:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:04:10,733 INFO L93 Difference]: Finished difference Result 187 states and 288 transitions. [2024-11-10 06:04:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:04:10,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 203 [2024-11-10 06:04:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:04:10,760 INFO L225 Difference]: With dead ends: 187 [2024-11-10 06:04:10,760 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 06:04:10,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:04:10,762 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:04:10,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 225 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 06:04:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 06:04:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-10 06:04:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:04:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-11-10 06:04:10,780 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 203 [2024-11-10 06:04:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:04:10,781 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-11-10 06:04:10,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 06:04:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-11-10 06:04:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 06:04:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:10,790 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:04:10,806 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 06:04:10,990 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 06:04:10,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1473982346, now seen corresponding path program 1 times [2024-11-10 06:04:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513238724] [2024-11-10 06:04:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:10,994 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 06:04:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:10,997 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 06:04:10,998 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 06:04:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:11,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:04:11,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:04:11,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:04:11,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:04:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513238724] [2024-11-10 06:04:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513238724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:04:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:04:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:04:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224282442] [2024-11-10 06:04:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:04:11,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:04:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:04:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:04:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:04:11,659 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:04:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:04:11,999 INFO L93 Difference]: Finished difference Result 267 states and 401 transitions. [2024-11-10 06:04:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:04:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-10 06:04:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:04:12,003 INFO L225 Difference]: With dead ends: 267 [2024-11-10 06:04:12,003 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 06:04:12,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 202 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 06:04:12,005 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:04:12,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 262 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:04:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 06:04:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2024-11-10 06:04:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 94 states have internal predecessors, (114), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:04:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2024-11-10 06:04:12,056 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 204 [2024-11-10 06:04:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:04:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2024-11-10 06:04:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:04:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2024-11-10 06:04:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 06:04:12,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:12,067 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:04:12,079 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 06:04:12,268 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 06:04:12,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:12,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:12,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042343, now seen corresponding path program 1 times [2024-11-10 06:04:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906169164] [2024-11-10 06:04:12,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:12,271 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 06:04:12,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:12,274 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 06:04:12,277 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 06:04:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:12,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:04:12,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:04:12,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:04:12,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:04:12,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906169164] [2024-11-10 06:04:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906169164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:04:12,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:04:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:04:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145565874] [2024-11-10 06:04:12,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:04:12,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:04:12,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:04:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:04:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:04:12,598 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:04:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:04:13,168 INFO L93 Difference]: Finished difference Result 254 states and 378 transitions. [2024-11-10 06:04:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:04:13,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 06:04:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:04:13,184 INFO L225 Difference]: With dead ends: 254 [2024-11-10 06:04:13,184 INFO L226 Difference]: Without dead ends: 162 [2024-11-10 06:04:13,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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 06:04:13,186 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 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 06:04:13,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:04:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-10 06:04:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-10 06:04:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 93 states have internal predecessors, (111), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:04:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2024-11-10 06:04:13,223 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 205 [2024-11-10 06:04:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:04:13,224 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2024-11-10 06:04:13,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:04:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2024-11-10 06:04:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 06:04:13,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:13,227 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:04:13,241 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 06:04:13,428 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 06:04:13,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:13,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1928162970, now seen corresponding path program 1 times [2024-11-10 06:04:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725357258] [2024-11-10 06:04:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:13,430 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 06:04:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:13,434 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 06:04:13,435 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 06:04:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:13,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 06:04:13,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-10 06:04:14,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:04:14,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:04:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725357258] [2024-11-10 06:04:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725357258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:04:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1179667525] [2024-11-10 06:04:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:04:14,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:04:14,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:04:14,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 06:04:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:15,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:04:15,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-10 06:04:15,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:04:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1179667525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:04:16,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:04:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-10 06:04:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420628617] [2024-11-10 06:04:16,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:04:16,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:04:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:04:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:04:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:04:16,046 INFO L87 Difference]: Start difference. First operand 162 states and 239 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-10 06:04:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:04:16,788 INFO L93 Difference]: Finished difference Result 283 states and 400 transitions. [2024-11-10 06:04:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 06:04:16,802 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), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 205 [2024-11-10 06:04:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:04:16,805 INFO L225 Difference]: With dead ends: 283 [2024-11-10 06:04:16,805 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 06:04:16,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:04:16,807 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 113 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:04:16,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 270 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 06:04:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 06:04:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2024-11-10 06:04:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 105 states have internal predecessors, (121), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:04:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2024-11-10 06:04:16,828 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 205 [2024-11-10 06:04:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:04:16,829 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2024-11-10 06:04:16,829 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), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-10 06:04:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2024-11-10 06:04:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-10 06:04:16,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:16,832 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:04:16,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-10 06:04:17,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 06:04:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 06:04:17,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 724680651, now seen corresponding path program 1 times [2024-11-10 06:04:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803213616] [2024-11-10 06:04:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:17,235 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 06:04:17,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:17,239 INFO L229 MonitoredProcess]: Starting monitored process 8 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 06:04:17,240 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 (8)] Waiting until timeout for monitored process [2024-11-10 06:04:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:17,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 06:04:17,535 INFO L278 TraceCheckSpWp]: Computing forward predicates...