./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-54.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-co_file-54.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 65c5b76d9cd5b2e1af4362f5fa134a0efb44e64a8020feb3e66714cdfab4c5ff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:22:10,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:22:10,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:22:11,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:22:11,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:22:11,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:22:11,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:22:11,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:22:11,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:22:11,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:22:11,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:22:11,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:22:11,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:22:11,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:22:11,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:22:11,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:22:11,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:22:11,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:22:11,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:22:11,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:22:11,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:22:11,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:22:11,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:22:11,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:22:11,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:22:11,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:22:11,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:22:11,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:22:11,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:22:11,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:22:11,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:22:11,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:22:11,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:22:11,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:22:11,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:22:11,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:22:11,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:22:11,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:22:11,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:22:11,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:22:11,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:22:11,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:22:11,067 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 -> 65c5b76d9cd5b2e1af4362f5fa134a0efb44e64a8020feb3e66714cdfab4c5ff [2024-11-10 06:22:11,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:22:11,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:22:11,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:22:11,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:22:11,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:22:11,391 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-co_file-54.i [2024-11-10 06:22:13,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:22:13,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:22:13,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-54.i [2024-11-10 06:22:13,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212e6240d/7ef8a5d531aa4c5997d8a5fc0e07d060/FLAG36fcc8f41 [2024-11-10 06:22:13,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212e6240d/7ef8a5d531aa4c5997d8a5fc0e07d060 [2024-11-10 06:22:13,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:22:13,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:22:13,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:22:13,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:22:13,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:22:13,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13, skipping insertion in model container [2024-11-10 06:22:13,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:22:13,562 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-co_file-54.i[919,932] [2024-11-10 06:22:13,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:22:13,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:22:13,690 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-co_file-54.i[919,932] [2024-11-10 06:22:13,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:22:13,793 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:22:13,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13 WrapperNode [2024-11-10 06:22:13,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:22:13,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:22:13,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:22:13,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:22:13,803 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:22:13" (1/1) ... [2024-11-10 06:22:13,817 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:22:13" (1/1) ... [2024-11-10 06:22:13,849 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2024-11-10 06:22:13,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:22:13,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:22:13,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:22:13,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:22:13,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,885 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:22:13,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:22:13,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:22:13,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:22:13,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:22:13,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (1/1) ... [2024-11-10 06:22:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:22:13,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:22:13,974 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:22:13,981 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:22:14,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:22:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:22:14,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:22:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:22:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:22:14,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:22:14,146 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:22:14,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:22:14,649 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:22:14,650 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:22:14,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:22:14,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:22:14,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:14 BoogieIcfgContainer [2024-11-10 06:22:14,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:22:14,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:22:14,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:22:14,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:22:14,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:22:13" (1/3) ... [2024-11-10 06:22:14,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab89542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:14, skipping insertion in model container [2024-11-10 06:22:14,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:13" (2/3) ... [2024-11-10 06:22:14,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab89542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:14, skipping insertion in model container [2024-11-10 06:22:14,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:14" (3/3) ... [2024-11-10 06:22:14,692 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-54.i [2024-11-10 06:22:14,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:22:14,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:22:14,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:22:14,828 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;@2f0285df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:22:14,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:22:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:22:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 06:22:14,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:14,870 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:14,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:14,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1790486285, now seen corresponding path program 1 times [2024-11-10 06:22:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938555627] [2024-11-10 06:22:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:15,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938555627] [2024-11-10 06:22:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938555627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:15,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:15,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097061113] [2024-11-10 06:22:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:15,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:22:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:22:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:22:15,717 INFO L87 Difference]: Start difference. First operand has 107 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:22:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:15,757 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2024-11-10 06:22:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:22:15,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 228 [2024-11-10 06:22:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:15,772 INFO L225 Difference]: With dead ends: 205 [2024-11-10 06:22:15,772 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 06:22:15,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:22:15,781 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:15,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 06:22:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 06:22:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:22:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-11-10 06:22:15,842 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 228 [2024-11-10 06:22:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-10 06:22:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:22:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-11-10 06:22:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 06:22:15,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:15,849 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:22:15,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1289918456, now seen corresponding path program 1 times [2024-11-10 06:22:15,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147211579] [2024-11-10 06:22:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147211579] [2024-11-10 06:22:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147211579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:16,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:16,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:16,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487711089] [2024-11-10 06:22:16,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:16,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:16,603 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:16,736 INFO L93 Difference]: Finished difference Result 294 states and 448 transitions. [2024-11-10 06:22:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-10 06:22:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:16,744 INFO L225 Difference]: With dead ends: 294 [2024-11-10 06:22:16,744 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 06:22:16,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:16,746 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 140 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:16,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 400 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:22:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 06:22:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-10 06:22:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:22:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 293 transitions. [2024-11-10 06:22:16,787 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 293 transitions. Word has length 228 [2024-11-10 06:22:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:16,788 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 293 transitions. [2024-11-10 06:22:16,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 293 transitions. [2024-11-10 06:22:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 06:22:16,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:16,797 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:16,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:22:16,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:16,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2007976487, now seen corresponding path program 1 times [2024-11-10 06:22:16,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:16,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538547030] [2024-11-10 06:22:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538547030] [2024-11-10 06:22:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538547030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677303089] [2024-11-10 06:22:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:17,495 INFO L87 Difference]: Start difference. First operand 193 states and 293 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:17,617 INFO L93 Difference]: Finished difference Result 481 states and 733 transitions. [2024-11-10 06:22:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:17,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2024-11-10 06:22:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:17,630 INFO L225 Difference]: With dead ends: 481 [2024-11-10 06:22:17,630 INFO L226 Difference]: Without dead ends: 291 [2024-11-10 06:22:17,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:17,637 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:17,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 286 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:22:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-10 06:22:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2024-11-10 06:22:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 179 states have internal predecessors, (230), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:22:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 440 transitions. [2024-11-10 06:22:17,749 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 440 transitions. Word has length 228 [2024-11-10 06:22:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:17,752 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 440 transitions. [2024-11-10 06:22:17,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 440 transitions. [2024-11-10 06:22:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 06:22:17,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:17,759 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:17,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:22:17,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:17,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:17,761 INFO L85 PathProgramCache]: Analyzing trace with hash 893232916, now seen corresponding path program 1 times [2024-11-10 06:22:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839880262] [2024-11-10 06:22:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839880262] [2024-11-10 06:22:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839880262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:18,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:22:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267123046] [2024-11-10 06:22:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:18,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:22:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:18,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:22:18,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:22:18,266 INFO L87 Difference]: Start difference. First operand 288 states and 440 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:18,368 INFO L93 Difference]: Finished difference Result 669 states and 1027 transitions. [2024-11-10 06:22:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:22:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 229 [2024-11-10 06:22:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:18,374 INFO L225 Difference]: With dead ends: 669 [2024-11-10 06:22:18,375 INFO L226 Difference]: Without dead ends: 384 [2024-11-10 06:22:18,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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:22:18,381 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 79 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:18,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 419 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-10 06:22:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 360. [2024-11-10 06:22:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 215 states have internal predecessors, (269), 140 states have call successors, (140), 4 states have call predecessors, (140), 4 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 06:22:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 549 transitions. [2024-11-10 06:22:18,465 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 549 transitions. Word has length 229 [2024-11-10 06:22:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:18,466 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 549 transitions. [2024-11-10 06:22:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 549 transitions. [2024-11-10 06:22:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-10 06:22:18,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:18,470 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:18,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:22:18,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:18,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash -175374709, now seen corresponding path program 1 times [2024-11-10 06:22:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109503163] [2024-11-10 06:22:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109503163] [2024-11-10 06:22:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109503163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:18,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:18,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:22:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141378269] [2024-11-10 06:22:18,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:18,896 INFO L87 Difference]: Start difference. First operand 360 states and 549 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:18,960 INFO L93 Difference]: Finished difference Result 930 states and 1423 transitions. [2024-11-10 06:22:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 230 [2024-11-10 06:22:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:18,969 INFO L225 Difference]: With dead ends: 930 [2024-11-10 06:22:18,969 INFO L226 Difference]: Without dead ends: 645 [2024-11-10 06:22:18,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:18,973 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 78 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:18,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 301 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-10 06:22:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2024-11-10 06:22:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 389 states have (on average 1.262210796915167) internal successors, (491), 389 states have internal predecessors, (491), 245 states have call successors, (245), 7 states have call predecessors, (245), 7 states have return successors, (245), 245 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-10 06:22:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 981 transitions. [2024-11-10 06:22:19,103 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 981 transitions. Word has length 230 [2024-11-10 06:22:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:19,104 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 981 transitions. [2024-11-10 06:22:19,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 981 transitions. [2024-11-10 06:22:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-10 06:22:19,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:19,107 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:19,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:22:19,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:19,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1177934988, now seen corresponding path program 1 times [2024-11-10 06:22:19,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:19,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606842647] [2024-11-10 06:22:19,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:19,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:19,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606842647] [2024-11-10 06:22:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606842647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:22:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653031679] [2024-11-10 06:22:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:19,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:22:19,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:22:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:22:19,561 INFO L87 Difference]: Start difference. First operand 642 states and 981 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:19,781 INFO L93 Difference]: Finished difference Result 1262 states and 1922 transitions. [2024-11-10 06:22:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:22:19,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 230 [2024-11-10 06:22:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:19,789 INFO L225 Difference]: With dead ends: 1262 [2024-11-10 06:22:19,789 INFO L226 Difference]: Without dead ends: 695 [2024-11-10 06:22:19,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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:22:19,793 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 104 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:19,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 436 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:22:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-10 06:22:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 654. [2024-11-10 06:22:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 401 states have (on average 1.2668329177057356) internal successors, (508), 401 states have internal predecessors, (508), 245 states have call successors, (245), 7 states have call predecessors, (245), 7 states have return successors, (245), 245 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-10 06:22:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 998 transitions. [2024-11-10 06:22:19,878 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 998 transitions. Word has length 230 [2024-11-10 06:22:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:19,879 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 998 transitions. [2024-11-10 06:22:19,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 998 transitions. [2024-11-10 06:22:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-10 06:22:19,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:19,882 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:19,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:22:19,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -676320327, now seen corresponding path program 1 times [2024-11-10 06:22:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:19,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968084611] [2024-11-10 06:22:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968084611] [2024-11-10 06:22:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968084611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:22:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866834839] [2024-11-10 06:22:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:22:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:22:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:22:20,405 INFO L87 Difference]: Start difference. First operand 654 states and 998 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:20,722 INFO L93 Difference]: Finished difference Result 1237 states and 1893 transitions. [2024-11-10 06:22:20,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:22:20,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 231 [2024-11-10 06:22:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:20,729 INFO L225 Difference]: With dead ends: 1237 [2024-11-10 06:22:20,730 INFO L226 Difference]: Without dead ends: 663 [2024-11-10 06:22:20,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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:22:20,734 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:20,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 332 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:22:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-10 06:22:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 655. [2024-11-10 06:22:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 402 states have (on average 1.2661691542288558) internal successors, (509), 402 states have internal predecessors, (509), 245 states have call successors, (245), 7 states have call predecessors, (245), 7 states have return successors, (245), 245 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-10 06:22:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 999 transitions. [2024-11-10 06:22:20,806 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 999 transitions. Word has length 231 [2024-11-10 06:22:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 999 transitions. [2024-11-10 06:22:20,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 999 transitions. [2024-11-10 06:22:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-10 06:22:20,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:20,810 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:20,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:22:20,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:20,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1312036067, now seen corresponding path program 1 times [2024-11-10 06:22:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153214831] [2024-11-10 06:22:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:22:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:22:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:22:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:22:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:22:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:22:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:22:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:22:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:22:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:22:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:22:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:22:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 06:22:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:22:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:22:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 06:22:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:22:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 06:22:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:22:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:22:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:22:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:22:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:22:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:22:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:22:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 06:22:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 06:22:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:22:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:22:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:22:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:22:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:22:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 06:22:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:22:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-10 06:22:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:21,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:22:21,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153214831] [2024-11-10 06:22:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153214831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:21,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:22:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318397875] [2024-11-10 06:22:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:21,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:22:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:22:21,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:22:21,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:22:21,643 INFO L87 Difference]: Start difference. First operand 655 states and 999 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:22,077 INFO L93 Difference]: Finished difference Result 1247 states and 1906 transitions. [2024-11-10 06:22:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:22:22,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 231 [2024-11-10 06:22:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:22,084 INFO L225 Difference]: With dead ends: 1247 [2024-11-10 06:22:22,085 INFO L226 Difference]: Without dead ends: 663 [2024-11-10 06:22:22,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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:22:22,088 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:22,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 456 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:22:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-10 06:22:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 656. [2024-11-10 06:22:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 403 states have (on average 1.2630272952853598) internal successors, (509), 403 states have internal predecessors, (509), 245 states have call successors, (245), 7 states have call predecessors, (245), 7 states have return successors, (245), 245 states have call predecessors, (245), 245 states have call successors, (245) [2024-11-10 06:22:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 999 transitions. [2024-11-10 06:22:22,163 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 999 transitions. Word has length 231 [2024-11-10 06:22:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 999 transitions. [2024-11-10 06:22:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 999 transitions. [2024-11-10 06:22:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-10 06:22:22,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:22,167 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:22,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:22:22,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:22,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 467564196, now seen corresponding path program 1 times [2024-11-10 06:22:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:22:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809771488] [2024-11-10 06:22:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:22:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:22:22,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325930082] [2024-11-10 06:22:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:22,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:22:22,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:22:22,460 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:22:22,461 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:22:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:22:22,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:22:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:22:23,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:22:23,579 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:22:23,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:22:23,598 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:22:23,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:22:23,787 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:23,957 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:22:23,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:22:23 BoogieIcfgContainer [2024-11-10 06:22:23,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:22:23,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:22:23,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:22:23,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:22:23,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:14" (3/4) ... [2024-11-10 06:22:23,964 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:22:23,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:22:23,967 INFO L158 Benchmark]: Toolchain (without parser) took 10620.85ms. Allocated memory was 165.7MB in the beginning and 318.8MB in the end (delta: 153.1MB). Free memory was 132.7MB in the beginning and 229.2MB in the end (delta: -96.5MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-11-10 06:22:23,967 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 165.7MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:22:23,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.42ms. Allocated memory is still 165.7MB. Free memory was 132.7MB in the beginning and 114.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:22:23,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.38ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 111.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:22:23,968 INFO L158 Benchmark]: Boogie Preprocessor took 62.97ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 108.0MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:22:23,968 INFO L158 Benchmark]: IcfgBuilder took 765.08ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 82.4MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 06:22:23,968 INFO L158 Benchmark]: TraceAbstraction took 9278.70ms. Allocated memory was 165.7MB in the beginning and 318.8MB in the end (delta: 153.1MB). Free memory was 81.5MB in the beginning and 229.2MB in the end (delta: -147.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-10 06:22:23,968 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 318.8MB. Free memory is still 229.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:22:23,970 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.27ms. Allocated memory is still 165.7MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.42ms. Allocated memory is still 165.7MB. Free memory was 132.7MB in the beginning and 114.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.38ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 111.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.97ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 108.0MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 765.08ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 82.4MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9278.70ms. Allocated memory was 165.7MB in the beginning and 318.8MB in the end (delta: 153.1MB). Free memory was 81.5MB in the beginning and 229.2MB in the end (delta: -147.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 318.8MB. Free memory is still 229.2MB. 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 196, overapproximation of shiftRight at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someUnaryFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] float var_1_23 = 4.8; [L42] float var_1_25 = 1000000.2; [L43] float var_1_27 = 50.3; [L44] float var_1_28 = 10.5; [L45] float var_1_29 = 100000000000.65; [L46] float var_1_30 = 25.4; [L47] float var_1_31 = 255.75; [L48] float var_1_32 = 256.625; [L49] unsigned short int var_1_33 = 1; [L50] unsigned short int var_1_34 = 256; [L51] signed long int var_1_35 = 10; [L52] signed char var_1_36 = -16; [L53] signed char var_1_38 = 32; [L54] signed char var_1_39 = 5; [L55] signed long int var_1_40 = 32; [L56] float var_1_41 = 24.25; [L57] float var_1_42 = 0.7; [L58] signed char var_1_43 = -100; [L59] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L193] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L134] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L135] var_1_5 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L136] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L137] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L138] var_1_8 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L139] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L140] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L141] var_1_10 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L142] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L143] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L143] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L144] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L145] var_1_11 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L146] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L147] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L148] var_1_12 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L149] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L150] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L151] var_1_15 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L152] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L153] var_1_16 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L154] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L155] var_1_17 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L156] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L157] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L158] var_1_19 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L159] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L160] var_1_20 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L161] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L162] var_1_21 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L163] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L164] var_1_22 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L165] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_27=503/10, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L166] var_1_27 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L167] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_28=21/2, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L168] var_1_28 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L169] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_29=2000000000013/20, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L170] var_1_29 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L171] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_30=127/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L172] var_1_30 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_30 >= -230584.3009213691390e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L173] RET assume_abort_if_not((var_1_30 >= -230584.3009213691390e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_31=1023/4, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L174] var_1_31 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_31 >= -230584.3009213691390e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 2305843.009213691390e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L175] RET assume_abort_if_not((var_1_31 >= -230584.3009213691390e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 2305843.009213691390e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_32=2053/8, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L176] var_1_32 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_32 >= -230584.3009213691390e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 2305843.009213691390e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L177] RET assume_abort_if_not((var_1_32 >= -230584.3009213691390e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 2305843.009213691390e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=256, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L178] var_1_34 = __VERIFIER_nondet_ushort() [L179] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L180] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L180] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=32, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L181] var_1_38 = __VERIFIER_nondet_char() [L182] CALL assume_abort_if_not(var_1_38 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L182] RET assume_abort_if_not(var_1_38 >= -127) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L183] CALL assume_abort_if_not(var_1_38 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L183] RET assume_abort_if_not(var_1_38 <= 126) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=5, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L184] var_1_39 = __VERIFIER_nondet_char() [L185] CALL assume_abort_if_not(var_1_39 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L185] RET assume_abort_if_not(var_1_39 >= -127) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L186] CALL assume_abort_if_not(var_1_39 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L186] RET assume_abort_if_not(var_1_39 <= 126) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_41=97/4, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L187] var_1_41 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L188] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_42=7/10, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L189] var_1_42 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L190] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L204] RET updateVariables() [L205] CALL step() [L63] COND TRUE var_1_6 > -64 [L64] var_1_23 = ((((49.2f) > (63.125f)) ? (49.2f) : (63.125f))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=5000001/5, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L66] COND TRUE var_1_1 >= var_1_14 [L67] var_1_25 = (((((((((((9.999999999999962E13f) < (var_1_27)) ? (9.999999999999962E13f) : (var_1_27))) < 0 ) ? -((((9.999999999999962E13f) < (var_1_27)) ? (9.999999999999962E13f) : (var_1_27))) : ((((9.999999999999962E13f) < (var_1_27)) ? (9.999999999999962E13f) : (var_1_27)))))) > (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? ((((((((9.999999999999962E13f) < (var_1_27)) ? (9.999999999999962E13f) : (var_1_27))) < 0 ) ? -((((9.999999999999962E13f) < (var_1_27)) ? (9.999999999999962E13f) : (var_1_27))) : ((((9.999999999999962E13f) < (var_1_27)) ? (9.999999999999962E13f) : (var_1_27)))))) : (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=1, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L71] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L72] EXPR var_1_1 >> var_1_34 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L72] EXPR var_1_14 ^ (var_1_1 >> var_1_34) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L72] COND FALSE !((var_1_14 ^ (var_1_1 >> var_1_34)) < var_1_14) [L75] COND FALSE !(! var_1_13) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L78] COND TRUE var_1_6 >= var_1_6 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=32, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L79] COND TRUE var_1_32 >= (var_1_41 - var_1_42) [L80] var_1_40 = ((((((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))) < 0 ) ? -(((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))) : (((((((-4) < 0 ) ? -(-4) : (-4))) < 0 ) ? -((((-4) < 0 ) ? -(-4) : (-4))) : ((((-4) < 0 ) ? -(-4) : (-4))))))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L87] COND FALSE !((var_1_38 < var_1_6) && (var_1_28 != var_1_41)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L94] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=12, var_1_9=1] [L95] COND TRUE var_1_5 == var_1_4 [L96] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=33/4, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=1] [L103] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L110] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=1] [L112] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L113] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=1] [L115] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=-15, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=1] [L116] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0 [L117] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] [L121] COND TRUE var_1_18 > var_1_18 [L122] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] [L126] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] [L127] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1 [L128] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-15, var_1_17=-2, var_1_18=3, var_1_19=3, var_1_1=-1, var_1_23=246/5, var_1_25=2, var_1_27=0, var_1_28=0, var_1_33=-65535, var_1_34=-65535, var_1_35=10, var_1_36=-16, var_1_38=-127, var_1_39=-127, var_1_40=4, var_1_43=-100, var_1_4=1, var_1_5=1, var_1_6=-11, var_1_8=12, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 2781 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1478 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 1303 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=656occurred in iteration=8, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2297 NumberOfCodeBlocks, 2297 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1827 ConstructedInterpolants, 0 QuantifiedInterpolants, 5730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 19040/19040 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:22:24,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-co_file-54.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 65c5b76d9cd5b2e1af4362f5fa134a0efb44e64a8020feb3e66714cdfab4c5ff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:22:26,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:22:26,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:22:26,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:22:26,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:22:26,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:22:26,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:22:26,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:22:26,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:22:26,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:22:26,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:22:26,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:22:26,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:22:26,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:22:26,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:22:26,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:22:26,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:22:26,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:22:26,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:22:26,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:22:26,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:22:26,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:22:26,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:22:26,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:22:26,588 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:22:26,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:22:26,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:22:26,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:22:26,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:22:26,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:22:26,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:22:26,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:22:26,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:22:26,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:22:26,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:22:26,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:22:26,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:22:26,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:22:26,610 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:22:26,610 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:22:26,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:22:26,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:22:26,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:22:26,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:22:26,612 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 -> 65c5b76d9cd5b2e1af4362f5fa134a0efb44e64a8020feb3e66714cdfab4c5ff [2024-11-10 06:22:26,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:22:26,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:22:26,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:22:26,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:22:26,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:22:26,999 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-co_file-54.i [2024-11-10 06:22:28,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:22:29,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:22:29,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-54.i [2024-11-10 06:22:29,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3c197b/e71d667cdb7540b0b7f0a7816681edd2/FLAG3e941ec0d [2024-11-10 06:22:29,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3c197b/e71d667cdb7540b0b7f0a7816681edd2 [2024-11-10 06:22:29,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:22:29,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:22:29,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:22:29,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:22:29,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:22:29,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392d5117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29, skipping insertion in model container [2024-11-10 06:22:29,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:22:29,351 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-co_file-54.i[919,932] [2024-11-10 06:22:29,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:22:29,500 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:22:29,515 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-co_file-54.i[919,932] [2024-11-10 06:22:29,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:22:29,607 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:22:29,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29 WrapperNode [2024-11-10 06:22:29,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:22:29,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:22:29,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:22:29,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:22:29,618 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:22:29" (1/1) ... [2024-11-10 06:22:29,639 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:22:29" (1/1) ... [2024-11-10 06:22:29,703 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-10 06:22:29,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:22:29,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:22:29,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:22:29,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:22:29,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,811 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:22:29,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:22:29,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:22:29,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:22:29,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:22:29,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (1/1) ... [2024-11-10 06:22:29,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:22:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:22:29,910 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:22:29,917 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:22:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:22:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:22:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:22:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:22:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:22:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:22:30,133 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:22:30,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:22:39,190 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:22:39,191 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:22:39,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:22:39,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:22:39,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:39 BoogieIcfgContainer [2024-11-10 06:22:39,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:22:39,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:22:39,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:22:39,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:22:39,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:22:29" (1/3) ... [2024-11-10 06:22:39,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135bddda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:39, skipping insertion in model container [2024-11-10 06:22:39,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:22:29" (2/3) ... [2024-11-10 06:22:39,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135bddda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:39, skipping insertion in model container [2024-11-10 06:22:39,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:39" (3/3) ... [2024-11-10 06:22:39,222 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-54.i [2024-11-10 06:22:39,240 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:22:39,241 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:22:39,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:22:39,339 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;@24fb2071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:22:39,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:22:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:22:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 06:22:39,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:39,366 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:39,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:39,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash 735553396, now seen corresponding path program 1 times [2024-11-10 06:22:39,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:22:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117575140] [2024-11-10 06:22:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:39,387 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:22:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:22:39,395 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:22:39,414 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:22:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:40,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:22:40,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:22:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2024-11-10 06:22:40,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:22:40,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:22:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117575140] [2024-11-10 06:22:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117575140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:40,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:40,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980443827] [2024-11-10 06:22:40,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:40,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:22:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:22:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:22:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:22:40,338 INFO L87 Difference]: Start difference. First operand has 101 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:22:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:40,379 INFO L93 Difference]: Finished difference Result 193 states and 336 transitions. [2024-11-10 06:22:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:22:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2024-11-10 06:22:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:40,389 INFO L225 Difference]: With dead ends: 193 [2024-11-10 06:22:40,390 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 06:22:40,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 225 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:22:40,398 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:40,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 06:22:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 06:22:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 58 states have internal predecessors, (72), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:22:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-11-10 06:22:40,465 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 226 [2024-11-10 06:22:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:40,466 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-11-10 06:22:40,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:22:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-11-10 06:22:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 06:22:40,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:40,471 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:40,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:22:40,672 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:22:40,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:40,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2101372914, now seen corresponding path program 1 times [2024-11-10 06:22:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:22:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569597502] [2024-11-10 06:22:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:40,676 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:22:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:22:40,679 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:22:40,681 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:22:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:41,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 06:22:41,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:22:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:46,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:22:46,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:22:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569597502] [2024-11-10 06:22:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569597502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:46,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597196047] [2024-11-10 06:22:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:22:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:46,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:46,670 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:52,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:22:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:53,171 INFO L93 Difference]: Finished difference Result 270 states and 410 transitions. [2024-11-10 06:22:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:53,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-10 06:22:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:53,177 INFO L225 Difference]: With dead ends: 270 [2024-11-10 06:22:53,177 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 06:22:53,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:53,180 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 24 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:53,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 267 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-10 06:22:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 06:22:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2024-11-10 06:22:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 92 states have internal predecessors, (107), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:22:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2024-11-10 06:22:53,220 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 226 [2024-11-10 06:22:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:53,221 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2024-11-10 06:22:53,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2024-11-10 06:22:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 06:22:53,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:53,226 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:53,264 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 (3)] Forceful destruction successful, exit code 0 [2024-11-10 06:22:53,427 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:22:53,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1605346254, now seen corresponding path program 1 times [2024-11-10 06:22:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:22:53,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181104878] [2024-11-10 06:22:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:22:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:22:53,433 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:22:53,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:22:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:54,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:22:54,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:22:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:56,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:22:56,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:22:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181104878] [2024-11-10 06:22:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181104878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707365211] [2024-11-10 06:22:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:22:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:56,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:56,100 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:23:00,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:23:01,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:23:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:23:01,965 INFO L93 Difference]: Finished difference Result 349 states and 525 transitions. [2024-11-10 06:23:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:23:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-10 06:23:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:23:01,975 INFO L225 Difference]: With dead ends: 349 [2024-11-10 06:23:01,977 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 06:23:01,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:23:01,980 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:23:01,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-10 06:23:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 06:23:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-10 06:23:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 145 states have (on average 1.193103448275862) internal successors, (173), 145 states have internal predecessors, (173), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:23:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2024-11-10 06:23:02,038 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 226 [2024-11-10 06:23:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:23:02,039 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2024-11-10 06:23:02,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:23:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2024-11-10 06:23:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 06:23:02,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:23:02,043 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:23:02,071 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:23:02,244 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:23:02,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:23:02,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:23:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1336311345, now seen corresponding path program 1 times [2024-11-10 06:23:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:23:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738056387] [2024-11-10 06:23:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:23:02,246 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:23:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:23:02,250 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:23:02,256 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:23:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:23:02,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 06:23:02,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:23:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:23:04,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:23:04,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:23:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738056387] [2024-11-10 06:23:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738056387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:23:04,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:23:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:23:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772383469] [2024-11-10 06:23:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:23:04,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:23:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:23:04,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:23:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:23:04,577 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:23:08,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:23:13,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:23:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:23:13,484 INFO L93 Difference]: Finished difference Result 465 states and 698 transitions. [2024-11-10 06:23:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:23:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-10 06:23:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:23:13,526 INFO L225 Difference]: With dead ends: 465 [2024-11-10 06:23:13,527 INFO L226 Difference]: Without dead ends: 284 [2024-11-10 06:23:13,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 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:23:13,529 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 82 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:23:13,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 409 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-10 06:23:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-10 06:23:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2024-11-10 06:23:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 151 states have internal predecessors, (181), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:23:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2024-11-10 06:23:13,577 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 226 [2024-11-10 06:23:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:23:13,578 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2024-11-10 06:23:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:23:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2024-11-10 06:23:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-10 06:23:13,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:23:13,581 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:23:13,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 06:23:13,782 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:23:13,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:23:13,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:23:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2053247820, now seen corresponding path program 1 times [2024-11-10 06:23:13,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:23:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780309648] [2024-11-10 06:23:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:23:13,784 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:23:13,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:23:13,786 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:23:13,787 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:23:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:23:14,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 06:23:14,571 INFO L278 TraceCheckSpWp]: Computing forward predicates...