./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-11.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-cn_file-11.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 ba99f8f347db41d776ab17020fc12b2d738ac1723a6d58c11d92d8f8fd33f728 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:06:42,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:06:42,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:06:42,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:06:42,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:06:42,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:06:42,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:06:42,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:06:42,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:06:42,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:06:42,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:06:42,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:06:42,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:06:42,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:06:42,270 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:06:42,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:06:42,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:06:42,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:06:42,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:06:42,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:06:42,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:06:42,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:06:42,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:06:42,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:06:42,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:06:42,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:06:42,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:06:42,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:06:42,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:06:42,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:06:42,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:06:42,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:06:42,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:42,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:06:42,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:06:42,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:06:42,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:06:42,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:06:42,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:06:42,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:06:42,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:06:42,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:06:42,291 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 -> ba99f8f347db41d776ab17020fc12b2d738ac1723a6d58c11d92d8f8fd33f728 [2024-11-10 06:06:42,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:06:42,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:06:42,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:06:42,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:06:42,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:06:42,783 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-cn_file-11.i [2024-11-10 06:06:44,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:06:44,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:06:44,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-11.i [2024-11-10 06:06:44,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4da5d9c7/235e150c5a914756b0b583021fba4711/FLAGc1557f36e [2024-11-10 06:06:44,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4da5d9c7/235e150c5a914756b0b583021fba4711 [2024-11-10 06:06:44,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:06:44,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:06:44,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:44,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:06:44,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:06:44,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:44" (1/1) ... [2024-11-10 06:06:44,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3326a8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:44, skipping insertion in model container [2024-11-10 06:06:44,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:44" (1/1) ... [2024-11-10 06:06:44,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:06:45,161 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-cn_file-11.i[919,932] [2024-11-10 06:06:45,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:06:45,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:06:45,312 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-cn_file-11.i[919,932] [2024-11-10 06:06:45,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:06:45,441 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:06:45,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45 WrapperNode [2024-11-10 06:06:45,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:45,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:06:45,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:06:45,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:06:45,462 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:06:45" (1/1) ... [2024-11-10 06:06:45,489 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:06:45" (1/1) ... [2024-11-10 06:06:45,573 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-11-10 06:06:45,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:06:45,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:06:45,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:06:45,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:06:45,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,633 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:06:45,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:06:45,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:06:45,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:06:45,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:06:45,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (1/1) ... [2024-11-10 06:06:45,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:06:45,772 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:06:45,797 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:06:45,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:06:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:06:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:06:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:06:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:06:45,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:06:46,078 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:06:46,080 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:06:46,797 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 06:06:46,804 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:06:46,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:06:46,855 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:06:46,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:46 BoogieIcfgContainer [2024-11-10 06:06:46,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:06:46,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:06:46,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:06:46,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:06:46,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:06:44" (1/3) ... [2024-11-10 06:06:46,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a26bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:06:46, skipping insertion in model container [2024-11-10 06:06:46,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:45" (2/3) ... [2024-11-10 06:06:46,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a26bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:06:46, skipping insertion in model container [2024-11-10 06:06:46,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:46" (3/3) ... [2024-11-10 06:06:46,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-11.i [2024-11-10 06:06:46,893 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:06:46,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:06:46,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:06:46,955 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;@1776b95b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:06:46,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:06:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:06:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 06:06:46,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:46,975 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:46,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:46,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1082434752, now seen corresponding path program 1 times [2024-11-10 06:06:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862711027] [2024-11-10 06:06:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862711027] [2024-11-10 06:06:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862711027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:06:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241976905] [2024-11-10 06:06:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:47,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:06:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:06:47,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:06:47,657 INFO L87 Difference]: Start difference. First operand has 106 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 06:06:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:47,700 INFO L93 Difference]: Finished difference Result 204 states and 360 transitions. [2024-11-10 06:06:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:06:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-11-10 06:06:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:47,714 INFO L225 Difference]: With dead ends: 204 [2024-11-10 06:06:47,714 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 06:06:47,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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:06:47,724 INFO L432 NwaCegarLoop]: 155 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, 155 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:06:47,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:06:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 06:06:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 06:06:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:06:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2024-11-10 06:06:47,777 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 209 [2024-11-10 06:06:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2024-11-10 06:06:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 06:06:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2024-11-10 06:06:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 06:06:47,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:47,784 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:47,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:06:47,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:47,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 505445535, now seen corresponding path program 1 times [2024-11-10 06:06:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437571460] [2024-11-10 06:06:47,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437571460] [2024-11-10 06:06:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437571460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176948559] [2024-11-10 06:06:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:48,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:48,279 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:48,494 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2024-11-10 06:06:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-10 06:06:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:48,502 INFO L225 Difference]: With dead ends: 263 [2024-11-10 06:06:48,502 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 06:06:48,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:48,504 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 96 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:48,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 586 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:06:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 06:06:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2024-11-10 06:06:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 06:06:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 253 transitions. [2024-11-10 06:06:48,542 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 253 transitions. Word has length 209 [2024-11-10 06:06:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:48,543 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 253 transitions. [2024-11-10 06:06:48,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 253 transitions. [2024-11-10 06:06:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 06:06:48,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:48,551 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:06:48,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1091035950, now seen corresponding path program 1 times [2024-11-10 06:06:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971683152] [2024-11-10 06:06:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971683152] [2024-11-10 06:06:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971683152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637700036] [2024-11-10 06:06:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:49,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:49,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:49,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:49,374 INFO L87 Difference]: Start difference. First operand 161 states and 253 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:49,828 INFO L93 Difference]: Finished difference Result 540 states and 848 transitions. [2024-11-10 06:06:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-10 06:06:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:49,834 INFO L225 Difference]: With dead ends: 540 [2024-11-10 06:06:49,834 INFO L226 Difference]: Without dead ends: 382 [2024-11-10 06:06:49,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:06:49,836 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 251 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:49,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 664 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:06:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-10 06:06:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2024-11-10 06:06:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 238 states have (on average 1.3739495798319328) internal successors, (327), 241 states have internal predecessors, (327), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-10 06:06:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 593 transitions. [2024-11-10 06:06:49,876 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 593 transitions. Word has length 210 [2024-11-10 06:06:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:49,877 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 593 transitions. [2024-11-10 06:06:49,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 593 transitions. [2024-11-10 06:06:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:06:49,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:49,880 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:06:49,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1131936415, now seen corresponding path program 1 times [2024-11-10 06:06:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140907212] [2024-11-10 06:06:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140907212] [2024-11-10 06:06:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140907212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:06:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713674196] [2024-11-10 06:06:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:50,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:06:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:06:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:06:50,076 INFO L87 Difference]: Start difference. First operand 378 states and 593 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:50,206 INFO L93 Difference]: Finished difference Result 667 states and 1048 transitions. [2024-11-10 06:06:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:06:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 06:06:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:50,211 INFO L225 Difference]: With dead ends: 667 [2024-11-10 06:06:50,212 INFO L226 Difference]: Without dead ends: 509 [2024-11-10 06:06:50,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:50,214 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 112 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:50,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 463 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-10 06:06:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 389. [2024-11-10 06:06:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 249 states have (on average 1.3855421686746987) internal successors, (345), 252 states have internal predecessors, (345), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-10 06:06:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 611 transitions. [2024-11-10 06:06:50,275 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 611 transitions. Word has length 211 [2024-11-10 06:06:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:50,276 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 611 transitions. [2024-11-10 06:06:50,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 611 transitions. [2024-11-10 06:06:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:06:50,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:50,278 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:06:50,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:50,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2084130150, now seen corresponding path program 1 times [2024-11-10 06:06:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348815110] [2024-11-10 06:06:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:50,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:50,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348815110] [2024-11-10 06:06:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348815110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:50,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:50,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:50,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985237522] [2024-11-10 06:06:50,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:50,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:50,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:50,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:50,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:50,472 INFO L87 Difference]: Start difference. First operand 389 states and 611 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:50,616 INFO L93 Difference]: Finished difference Result 881 states and 1386 transitions. [2024-11-10 06:06:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:50,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 06:06:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:50,621 INFO L225 Difference]: With dead ends: 881 [2024-11-10 06:06:50,622 INFO L226 Difference]: Without dead ends: 556 [2024-11-10 06:06:50,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:50,625 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 95 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:50,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 593 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-10 06:06:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 377. [2024-11-10 06:06:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 240 states have internal predecessors, (323), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-10 06:06:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 589 transitions. [2024-11-10 06:06:50,661 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 589 transitions. Word has length 211 [2024-11-10 06:06:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:50,661 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 589 transitions. [2024-11-10 06:06:50,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 589 transitions. [2024-11-10 06:06:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:06:50,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:50,664 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:50,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:06:50,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:50,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1776679857, now seen corresponding path program 1 times [2024-11-10 06:06:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248629057] [2024-11-10 06:06:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248629057] [2024-11-10 06:06:51,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248629057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:51,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:51,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589841291] [2024-11-10 06:06:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:51,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:51,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:51,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:51,341 INFO L87 Difference]: Start difference. First operand 377 states and 589 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:51,435 INFO L93 Difference]: Finished difference Result 737 states and 1145 transitions. [2024-11-10 06:06:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 06:06:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:51,440 INFO L225 Difference]: With dead ends: 737 [2024-11-10 06:06:51,440 INFO L226 Difference]: Without dead ends: 424 [2024-11-10 06:06:51,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:51,443 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 36 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:51,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 561 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:06:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-10 06:06:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 393. [2024-11-10 06:06:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 256 states have internal predecessors, (347), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 130 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-10 06:06:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 613 transitions. [2024-11-10 06:06:51,480 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 613 transitions. Word has length 211 [2024-11-10 06:06:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 613 transitions. [2024-11-10 06:06:51,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 613 transitions. [2024-11-10 06:06:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:06:51,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:51,483 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:51,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:06:51,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1805309008, now seen corresponding path program 1 times [2024-11-10 06:06:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593745233] [2024-11-10 06:06:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:06:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:52,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593745233] [2024-11-10 06:06:52,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593745233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:06:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:06:52,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:06:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094742341] [2024-11-10 06:06:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:06:52,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:06:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:06:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:06:52,072 INFO L87 Difference]: Start difference. First operand 393 states and 613 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:52,357 INFO L93 Difference]: Finished difference Result 842 states and 1320 transitions. [2024-11-10 06:06:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:06:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-10 06:06:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:52,363 INFO L225 Difference]: With dead ends: 842 [2024-11-10 06:06:52,363 INFO L226 Difference]: Without dead ends: 513 [2024-11-10 06:06:52,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:06:52,365 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 126 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:52,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 524 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:06:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-10 06:06:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 447. [2024-11-10 06:06:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 307 states have (on average 1.4169381107491856) internal successors, (435), 309 states have internal predecessors, (435), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-10 06:06:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 701 transitions. [2024-11-10 06:06:52,416 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 701 transitions. Word has length 211 [2024-11-10 06:06:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:52,417 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 701 transitions. [2024-11-10 06:06:52,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:06:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 701 transitions. [2024-11-10 06:06:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 06:06:52,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:52,420 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:06:52,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash -593217256, now seen corresponding path program 1 times [2024-11-10 06:06:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615874404] [2024-11-10 06:06:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:06:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:06:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:06:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:06:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:06:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:06:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:06:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:06:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:06:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:06:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:06:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:06:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:06:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:06:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:06:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:06:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:06:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:06:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:06:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:06:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:06:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:06:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:06:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:06:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:06:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:06:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:06:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:06:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 06:06:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 06:06:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 06:06:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 06:06:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 06:06:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 06:06:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:06:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615874404] [2024-11-10 06:06:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615874404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:06:52,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348585527] [2024-11-10 06:06:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:06:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:06:53,001 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:06:53,022 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:06:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:06:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 06:06:53,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:06:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-10 06:06:53,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:06:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 06:06:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348585527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:06:54,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:06:54,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-10 06:06:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968728313] [2024-11-10 06:06:54,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:06:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:06:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:06:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:06:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:06:54,022 INFO L87 Difference]: Start difference. First operand 447 states and 701 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 06:06:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:06:54,288 INFO L93 Difference]: Finished difference Result 802 states and 1232 transitions. [2024-11-10 06:06:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:06:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 212 [2024-11-10 06:06:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:06:54,293 INFO L225 Difference]: With dead ends: 802 [2024-11-10 06:06:54,293 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 06:06:54,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:06:54,295 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 328 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:06:54,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 272 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:06:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 06:06:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 451. [2024-11-10 06:06:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 306 states have (on average 1.3660130718954249) internal successors, (418), 308 states have internal predecessors, (418), 133 states have call successors, (133), 11 states have call predecessors, (133), 11 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-10 06:06:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 684 transitions. [2024-11-10 06:06:54,339 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 684 transitions. Word has length 212 [2024-11-10 06:06:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:06:54,340 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 684 transitions. [2024-11-10 06:06:54,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 06:06:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 684 transitions. [2024-11-10 06:06:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 06:06:54,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:06:54,342 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:54,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:06:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:06:54,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:06:54,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:06:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1000320653, now seen corresponding path program 1 times [2024-11-10 06:06:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:06:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828756072] [2024-11-10 06:06:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:06:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:06:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:06:54,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:06:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:06:54,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:06:54,915 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:06:54,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:06:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 06:06:54,920 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:06:55,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:06:55,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:06:55 BoogieIcfgContainer [2024-11-10 06:06:55,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:06:55,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:06:55,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:06:55,049 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:06:55,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:06:46" (3/4) ... [2024-11-10 06:06:55,052 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:06:55,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:06:55,053 INFO L158 Benchmark]: Toolchain (without parser) took 10128.90ms. Allocated memory was 134.2MB in the beginning and 312.5MB in the end (delta: 178.3MB). Free memory was 63.8MB in the beginning and 148.6MB in the end (delta: -84.8MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2024-11-10 06:06:55,053 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 134.2MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:06:55,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.02ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 63.6MB in the beginning and 135.2MB in the end (delta: -71.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-10 06:06:55,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.26ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 132.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:06:55,054 INFO L158 Benchmark]: Boogie Preprocessor took 92.91ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 128.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:06:55,054 INFO L158 Benchmark]: IcfgBuilder took 1180.87ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 102.5MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 06:06:55,054 INFO L158 Benchmark]: TraceAbstraction took 8185.80ms. Allocated memory was 172.0MB in the beginning and 312.5MB in the end (delta: 140.5MB). Free memory was 101.6MB in the beginning and 148.6MB in the end (delta: -47.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-11-10 06:06:55,054 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 312.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:06:55,055 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.23ms. Allocated memory is still 134.2MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.02ms. Allocated memory was 134.2MB in the beginning and 172.0MB in the end (delta: 37.7MB). Free memory was 63.6MB in the beginning and 135.2MB in the end (delta: -71.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 134.26ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 132.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.91ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 128.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1180.87ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 102.5MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8185.80ms. Allocated memory was 172.0MB in the beginning and 312.5MB in the end (delta: 140.5MB). Free memory was 101.6MB in the beginning and 148.6MB in the end (delta: -47.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 312.5MB. Free memory is still 148.6MB. 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 76, overapproximation of shiftRight at line 68, overapproximation of someUnaryDOUBLEoperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryArithmeticFLOAToperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] signed char var_1_24 = -128; [L42] unsigned char var_1_25 = 10; [L43] signed char var_1_26 = 10; [L44] unsigned char var_1_27 = 128; [L45] unsigned char var_1_28 = 100; [L46] unsigned char var_1_29 = 1; [L47] float var_1_30 = 31.3; [L48] float var_1_31 = 1.5; [L49] float var_1_32 = 15.25; [L50] double var_1_33 = 128.8; [L51] signed char var_1_34 = 4; [L52] signed char var_1_35 = 1; [L53] unsigned char var_1_36 = 16; [L54] unsigned long int last_1_var_1_10 = 128; [L55] unsigned long int last_1_var_1_16 = 1; [L56] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=0, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=0, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] var_1_3 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L150] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L151] var_1_7 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L153] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L154] var_1_8 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L156] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L157] var_1_9 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L158] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L159] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L160] var_1_11 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L162] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L163] var_1_17 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L164] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L165] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L166] var_1_18 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L167] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L168] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L169] var_1_20 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L170] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=-128, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L171] var_1_24 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_24 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L172] RET assume_abort_if_not(var_1_24 >= -128) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L173] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=10, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L174] var_1_26 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L175] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L176] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=128, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L177] var_1_27 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L178] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L179] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=100, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L181] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L182] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_31=3/2, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L186] var_1_31 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L187] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L188] var_1_32 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L190] var_1_34 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L193] var_1_35 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L194] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L195] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L195] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L211] RET updateVariables() [L212] CALL step() [L60] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L61] COND FALSE !(var_1_22 > var_1_24) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] EXPR var_1_26 >> var_1_23 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] EXPR ((var_1_22) < ((var_1_26 >> var_1_23))) ? (var_1_22) : ((var_1_26 >> var_1_23)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=10, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L68] COND FALSE !(var_1_24 <= ((((var_1_22) < ((var_1_26 >> var_1_23))) ? (var_1_22) : ((var_1_26 >> var_1_23))))) [L71] COND TRUE \read(var_1_29) [L72] var_1_25 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L75] COND TRUE \read(var_1_29) [L76] var_1_30 = ((((var_1_31) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_31) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L78] COND FALSE !(var_1_26 >= var_1_24) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L91] COND FALSE !(var_1_27 >= (var_1_28 + var_1_22)) [L100] var_1_36 = var_1_28 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] unsigned long int stepLocal_1 = last_1_var_1_16; [L103] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L104] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L113] COND TRUE var_1_12 == var_1_12 [L114] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L116] var_1_1 = (var_1_2 || (! var_1_3)) [L117] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L118] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L119] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L120] COND FALSE !(var_1_19 >= var_1_19) [L125] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L130] COND TRUE var_1_19 != var_1_19 [L131] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L139] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L140] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L141] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=6174510458, var_1_11=-2147483649, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_24=28, var_1_25=-129, var_1_26=27, var_1_27=151, var_1_28=-129, var_1_29=1, var_1_2=1, var_1_30=6174510463, var_1_31=6174510463, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=-129, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1077 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1044 mSDsluCounter, 3818 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2402 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 924 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1416 mSDtfsCounter, 924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 994 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=451occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 426 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2109 NumberOfCodeBlocks, 2109 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2098 ConstructedInterpolants, 0 QuantifiedInterpolants, 3992 SizeOfPredicates, 3 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 20859/21120 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:06:55,085 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-cn_file-11.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 ba99f8f347db41d776ab17020fc12b2d738ac1723a6d58c11d92d8f8fd33f728 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:06:57,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:06:57,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:06:57,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:06:57,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:06:57,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:06:57,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:06:57,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:06:57,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:06:57,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:06:57,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:06:57,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:06:57,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:06:57,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:06:57,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:06:57,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:06:57,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:06:57,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:06:57,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:06:57,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:06:57,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:06:57,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:06:57,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:06:57,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:06:57,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:06:57,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:06:57,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:06:57,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:06:57,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:06:57,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:06:57,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:06:57,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:06:57,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:06:57,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:06:57,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:06:57,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:06:57,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:06:57,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:06:57,605 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 -> ba99f8f347db41d776ab17020fc12b2d738ac1723a6d58c11d92d8f8fd33f728 [2024-11-10 06:06:57,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:06:57,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:06:57,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:06:57,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:06:57,967 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:06:57,968 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-cn_file-11.i [2024-11-10 06:06:59,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:06:59,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:06:59,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-11.i [2024-11-10 06:06:59,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b015ade/f4fe10bff45748cdad2b462715354d6a/FLAGbb762e80a [2024-11-10 06:06:59,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b015ade/f4fe10bff45748cdad2b462715354d6a [2024-11-10 06:06:59,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:06:59,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:06:59,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:06:59,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:06:59,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:06:59,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:59" (1/1) ... [2024-11-10 06:06:59,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6417e5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:06:59, skipping insertion in model container [2024-11-10 06:06:59,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:06:59" (1/1) ... [2024-11-10 06:06:59,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:07:00,131 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-cn_file-11.i[919,932] [2024-11-10 06:07:00,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:07:00,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:07:00,283 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-cn_file-11.i[919,932] [2024-11-10 06:07:00,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:07:00,322 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:07:00,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00 WrapperNode [2024-11-10 06:07:00,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:07:00,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:07:00,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:07:00,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:07:00,331 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:07:00" (1/1) ... [2024-11-10 06:07:00,348 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:07:00" (1/1) ... [2024-11-10 06:07:00,380 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-10 06:07:00,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:07:00,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:07:00,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:07:00,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:07:00,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,419 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:07:00,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:07:00,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:07:00,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:07:00,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:07:00,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (1/1) ... [2024-11-10 06:07:00,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:07:00,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:07:00,549 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:07:00,563 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:07:00,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:07:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:07:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:07:00,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:07:00,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:07:00,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:07:00,742 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:07:00,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:07:04,631 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:07:04,632 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:07:04,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:07:04,669 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:07:04,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:07:04 BoogieIcfgContainer [2024-11-10 06:07:04,669 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:07:04,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:07:04,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:07:04,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:07:04,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:06:59" (1/3) ... [2024-11-10 06:07:04,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059bc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:07:04, skipping insertion in model container [2024-11-10 06:07:04,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:00" (2/3) ... [2024-11-10 06:07:04,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059bc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:07:04, skipping insertion in model container [2024-11-10 06:07:04,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:07:04" (3/3) ... [2024-11-10 06:07:04,677 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-11.i [2024-11-10 06:07:04,691 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:07:04,692 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:07:04,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:07:04,749 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;@df2a3b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:07:04,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:07:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:07:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 06:07:04,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:07:04,770 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:04,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:07:04,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:07:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -189789963, now seen corresponding path program 1 times [2024-11-10 06:07:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:07:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100717258] [2024-11-10 06:07:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:07:04,787 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:07:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:07:04,792 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:07:04,808 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:07:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:07:05,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:07:05,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:07:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-10 06:07:05,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:07:05,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:07:05,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100717258] [2024-11-10 06:07:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100717258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:07:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:07:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:07:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690763047] [2024-11-10 06:07:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:07:05,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:07:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:07:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:07:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:07:05,180 INFO L87 Difference]: Start difference. First operand has 98 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 06:07:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:07:05,208 INFO L93 Difference]: Finished difference Result 188 states and 336 transitions. [2024-11-10 06:07:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:07:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 207 [2024-11-10 06:07:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:07:05,218 INFO L225 Difference]: With dead ends: 188 [2024-11-10 06:07:05,218 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 06:07:05,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 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:07:05,226 INFO L432 NwaCegarLoop]: 145 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, 145 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:07:05,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:07:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 06:07:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 06:07:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:07:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2024-11-10 06:07:05,271 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 207 [2024-11-10 06:07:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:07:05,271 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2024-11-10 06:07:05,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 06:07:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2024-11-10 06:07:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 06:07:05,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:07:05,276 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:05,285 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:07:05,479 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:07:05,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:07:05,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:07:05,481 INFO L85 PathProgramCache]: Analyzing trace with hash 513537556, now seen corresponding path program 1 times [2024-11-10 06:07:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:07:05,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800862795] [2024-11-10 06:07:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:07:05,483 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:07:05,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:07:05,486 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:07:05,489 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:07:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:07:05,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:07:05,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:07:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:07:07,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:07:07,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:07:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800862795] [2024-11-10 06:07:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800862795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:07:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:07:07,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:07:07,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114894937] [2024-11-10 06:07:07,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:07:07,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:07:07,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:07:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:07:07,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:07:07,891 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:07:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:07:08,549 INFO L93 Difference]: Finished difference Result 275 states and 431 transitions. [2024-11-10 06:07:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:07:08,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-11-10 06:07:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:07:08,556 INFO L225 Difference]: With dead ends: 275 [2024-11-10 06:07:08,556 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 06:07:08,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:07:08,558 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 103 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:07:08,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 484 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:07:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 06:07:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2024-11-10 06:07:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 06:07:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2024-11-10 06:07:08,627 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 207 [2024-11-10 06:07:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:07:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2024-11-10 06:07:08,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:07:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2024-11-10 06:07:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-10 06:07:08,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:07:08,645 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:08,662 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:07:08,846 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:07:08,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:07:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:07:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1124552074, now seen corresponding path program 1 times [2024-11-10 06:07:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:07:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549466609] [2024-11-10 06:07:08,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:07:08,852 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:07:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:07:08,855 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:07: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 (4)] Waiting until timeout for monitored process [2024-11-10 06:07:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:07:09,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:07:09,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:07:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 386 proven. 87 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-10 06:07:10,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:07:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 06:07:10,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:07:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549466609] [2024-11-10 06:07:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549466609] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:07:10,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:07:10,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 06:07:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301780476] [2024-11-10 06:07:10,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:07:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:07:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:07:10,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:07:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:07:10,728 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 06:07:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:07:11,915 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2024-11-10 06:07:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:07:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 208 [2024-11-10 06:07:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:07:11,924 INFO L225 Difference]: With dead ends: 271 [2024-11-10 06:07:11,924 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 06:07:11,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 407 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:07:11,930 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 260 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 06:07:11,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 241 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 06:07:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 06:07:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2024-11-10 06:07:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 102 states have internal predecessors, (132), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 06:07:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 264 transitions. [2024-11-10 06:07:11,977 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 264 transitions. Word has length 208 [2024-11-10 06:07:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:07:11,979 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 264 transitions. [2024-11-10 06:07:11,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-11-10 06:07:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 264 transitions. [2024-11-10 06:07:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 06:07:11,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:07:11,982 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,992 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 06:07:12,186 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:07:12,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:07:12,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:07:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash 595672854, now seen corresponding path program 1 times [2024-11-10 06:07:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:07:12,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972483269] [2024-11-10 06:07:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:07:12,192 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:07:12,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:07:12,197 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:07:12,207 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:07:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:07:12,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 06:07:12,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:07:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 06:07:13,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:07:13,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:07:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972483269] [2024-11-10 06:07:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972483269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:07:13,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:07:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:07:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287134152] [2024-11-10 06:07:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:07:13,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:07:13,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:07:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:07:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:07:13,456 INFO L87 Difference]: Start difference. First operand 173 states and 264 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:07:17,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:07:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:07:17,971 INFO L93 Difference]: Finished difference Result 271 states and 413 transitions. [2024-11-10 06:07:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:07:17,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-10 06:07:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:07:17,975 INFO L225 Difference]: With dead ends: 271 [2024-11-10 06:07:17,975 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 06:07:17,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:07:17,977 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 109 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:07:17,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 338 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-10 06:07:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 06:07:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-11-10 06:07:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 102 states have internal predecessors, (130), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 06:07:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2024-11-10 06:07:18,004 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 209 [2024-11-10 06:07:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:07:18,004 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2024-11-10 06:07:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 06:07:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2024-11-10 06:07:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:07:18,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:07:18,006 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 06:07:18,207 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:07:18,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:07:18,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:07:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1121564565, now seen corresponding path program 1 times [2024-11-10 06:07:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:07:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439443317] [2024-11-10 06:07:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:07:18,209 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:07:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:07:18,213 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:07:18,223 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:07:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:07:18,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 06:07:18,427 INFO L278 TraceCheckSpWp]: Computing forward predicates...