./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:04:28,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:04:28,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:04:28,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:04:28,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:04:28,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:04:28,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:04:28,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:04:28,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:04:28,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:04:28,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:04:28,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:04:28,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:04:28,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:04:28,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:04:28,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:04:28,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:04:28,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:04:28,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:04:28,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:04:28,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:04:28,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:04:28,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:04:28,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:04:28,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:04:28,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:04:28,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:04:28,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:04:28,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:04:28,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:04:28,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:04:28,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:04:28,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:04:28,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:04:28,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:04:28,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:04:28,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:04:28,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:04:28,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:04:28,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:04:28,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:04:28,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:04:28,712 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-11-10 04:04:28,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:04:28,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:04:29,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:04:29,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:04:29,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:04:29,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-10 04:04:30,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:04:30,754 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:04:30,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-10 04:04:30,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477bdcf1a/1488a79201ce4b5fad03a13887ce16c1/FLAGcafe88c4f [2024-11-10 04:04:30,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477bdcf1a/1488a79201ce4b5fad03a13887ce16c1 [2024-11-10 04:04:30,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:04:30,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:04:30,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:04:30,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:04:30,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:04:30,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:04:30" (1/1) ... [2024-11-10 04:04:30,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5528f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:30, skipping insertion in model container [2024-11-10 04:04:30,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:04:30" (1/1) ... [2024-11-10 04:04:30,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:04:31,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-10 04:04:31,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:04:31,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:04:31,182 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-10 04:04:31,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:04:31,253 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:04:31,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31 WrapperNode [2024-11-10 04:04:31,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:04:31,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:04:31,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:04:31,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:04:31,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,316 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-11-10 04:04:31,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:04:31,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:04:31,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:04:31,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:04:31,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,367 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 04:04:31,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:04:31,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:04:31,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:04:31,387 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:04:31,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (1/1) ... [2024-11-10 04:04:31,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:04:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:04:31,431 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 04:04:31,436 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 04:04:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:04:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:04:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:04:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:04:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:04:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:04:31,595 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:04:31,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:04:32,165 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:04:32,166 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:04:32,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:04:32,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:04:32,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:04:32 BoogieIcfgContainer [2024-11-10 04:04:32,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:04:32,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:04:32,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:04:32,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:04:32,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:04:30" (1/3) ... [2024-11-10 04:04:32,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2ac333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:04:32, skipping insertion in model container [2024-11-10 04:04:32,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:04:31" (2/3) ... [2024-11-10 04:04:32,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2ac333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:04:32, skipping insertion in model container [2024-11-10 04:04:32,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:04:32" (3/3) ... [2024-11-10 04:04:32,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-10 04:04:32,221 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:04:32,221 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:04:32,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:04:32,296 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;@1d90b9ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:04:32,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:04:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 04:04:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 04:04:32,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:32,319 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:32,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:32,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1084263143, now seen corresponding path program 1 times [2024-11-10 04:04:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:32,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886225821] [2024-11-10 04:04:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:32,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:04:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:32,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886225821] [2024-11-10 04:04:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886225821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:04:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:04:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:04:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581702493] [2024-11-10 04:04:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:04:32,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:04:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:32,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:04:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:04:33,000 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 04:04:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:33,047 INFO L93 Difference]: Finished difference Result 160 states and 279 transitions. [2024-11-10 04:04:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:04:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-11-10 04:04:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:33,060 INFO L225 Difference]: With dead ends: 160 [2024-11-10 04:04:33,060 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 04:04:33,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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 04:04:33,068 INFO L432 NwaCegarLoop]: 119 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, 119 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 04:04:33,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:04:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 04:04:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 04:04:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 04:04:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-11-10 04:04:33,130 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 188 [2024-11-10 04:04:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:33,132 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-11-10 04:04:33,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 04:04:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-11-10 04:04:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:04:33,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:33,140 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:33,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:04:33,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:33,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1506766452, now seen corresponding path program 1 times [2024-11-10 04:04:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437955681] [2024-11-10 04:04:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:04:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437955681] [2024-11-10 04:04:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437955681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:04:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:04:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:04:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756840008] [2024-11-10 04:04:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:04:34,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:04:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:04:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:04:34,489 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:34,982 INFO L93 Difference]: Finished difference Result 262 states and 388 transitions. [2024-11-10 04:04:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:04:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 189 [2024-11-10 04:04:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:34,986 INFO L225 Difference]: With dead ends: 262 [2024-11-10 04:04:34,987 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 04:04:34,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:04:34,989 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 154 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:34,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 591 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:04:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 04:04:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-10 04:04:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:04:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2024-11-10 04:04:35,041 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 189 [2024-11-10 04:04:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:35,044 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2024-11-10 04:04:35,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2024-11-10 04:04:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:04:35,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:35,048 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:04:35,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1478137301, now seen corresponding path program 1 times [2024-11-10 04:04:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:35,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281516583] [2024-11-10 04:04:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:04:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281516583] [2024-11-10 04:04:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281516583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:04:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:04:40,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 04:04:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544302698] [2024-11-10 04:04:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:04:40,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 04:04:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 04:04:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:04:40,646 INFO L87 Difference]: Start difference. First operand 156 states and 237 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:41,784 INFO L93 Difference]: Finished difference Result 506 states and 745 transitions. [2024-11-10 04:04:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 04:04:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 189 [2024-11-10 04:04:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:41,793 INFO L225 Difference]: With dead ends: 506 [2024-11-10 04:04:41,794 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 04:04:41,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:04:41,800 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 190 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:41,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 614 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:04:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 04:04:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 245. [2024-11-10 04:04:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 150 states have internal predecessors, (187), 90 states have call successors, (90), 4 states have call predecessors, (90), 4 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 04:04:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 367 transitions. [2024-11-10 04:04:41,887 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 367 transitions. Word has length 189 [2024-11-10 04:04:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:41,888 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 367 transitions. [2024-11-10 04:04:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 367 transitions. [2024-11-10 04:04:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:04:41,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:41,895 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:04:41,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1771540308, now seen corresponding path program 1 times [2024-11-10 04:04:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120205180] [2024-11-10 04:04:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:04:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120205180] [2024-11-10 04:04:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120205180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:04:42,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:04:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:04:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803415140] [2024-11-10 04:04:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:04:42,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:04:42,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:42,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:04:42,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:04:42,381 INFO L87 Difference]: Start difference. First operand 245 states and 367 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:42,461 INFO L93 Difference]: Finished difference Result 558 states and 844 transitions. [2024-11-10 04:04:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:04:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 189 [2024-11-10 04:04:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:42,467 INFO L225 Difference]: With dead ends: 558 [2024-11-10 04:04:42,467 INFO L226 Difference]: Without dead ends: 398 [2024-11-10 04:04:42,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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 04:04:42,470 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 59 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:42,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 235 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:04:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-10 04:04:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-11-10 04:04:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 238 states have (on average 1.2394957983193278) internal successors, (295), 238 states have internal predecessors, (295), 150 states have call successors, (150), 6 states have call predecessors, (150), 6 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-10 04:04:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 595 transitions. [2024-11-10 04:04:42,543 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 595 transitions. Word has length 189 [2024-11-10 04:04:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:42,544 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 595 transitions. [2024-11-10 04:04:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 595 transitions. [2024-11-10 04:04:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:04:42,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:42,548 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:42,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:04:42,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:42,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1843436027, now seen corresponding path program 1 times [2024-11-10 04:04:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:42,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489726779] [2024-11-10 04:04:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 04:04:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489726779] [2024-11-10 04:04:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489726779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:04:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084747805] [2024-11-10 04:04:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:42,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:04:42,981 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 04:04:42,982 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 04:04:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:43,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:04:43,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:04:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2024-11-10 04:04:43,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:04:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 04:04:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084747805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:04:43,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:04:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 04:04:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784955798] [2024-11-10 04:04:43,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:04:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:04:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:43,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:04:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:04:43,820 INFO L87 Difference]: Start difference. First operand 395 states and 595 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-10 04:04:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:44,096 INFO L93 Difference]: Finished difference Result 727 states and 1072 transitions. [2024-11-10 04:04:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:04:44,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 190 [2024-11-10 04:04:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:44,102 INFO L225 Difference]: With dead ends: 727 [2024-11-10 04:04:44,102 INFO L226 Difference]: Without dead ends: 420 [2024-11-10 04:04:44,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:04:44,105 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:44,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:04:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-10 04:04:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 384. [2024-11-10 04:04:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 222 states have (on average 1.1306306306306306) internal successors, (251), 222 states have internal predecessors, (251), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-10 04:04:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 551 transitions. [2024-11-10 04:04:44,161 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 551 transitions. Word has length 190 [2024-11-10 04:04:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:44,161 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 551 transitions. [2024-11-10 04:04:44,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-10 04:04:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 551 transitions. [2024-11-10 04:04:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:04:44,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:44,164 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:44,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:04:44,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:44,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1687133445, now seen corresponding path program 1 times [2024-11-10 04:04:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440758729] [2024-11-10 04:04:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:04:44,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:44,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440758729] [2024-11-10 04:04:44,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440758729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:04:44,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:04:44,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:04:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364108779] [2024-11-10 04:04:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:04:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:04:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:04:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:04:44,634 INFO L87 Difference]: Start difference. First operand 384 states and 551 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:44,863 INFO L93 Difference]: Finished difference Result 685 states and 986 transitions. [2024-11-10 04:04:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:04:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-10 04:04:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:44,869 INFO L225 Difference]: With dead ends: 685 [2024-11-10 04:04:44,869 INFO L226 Difference]: Without dead ends: 531 [2024-11-10 04:04:44,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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 04:04:44,871 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:44,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 427 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:04:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-10 04:04:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 526. [2024-11-10 04:04:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 300 states have (on average 1.12) internal successors, (336), 300 states have internal predecessors, (336), 210 states have call successors, (210), 15 states have call predecessors, (210), 15 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-10 04:04:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 756 transitions. [2024-11-10 04:04:44,947 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 756 transitions. Word has length 190 [2024-11-10 04:04:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 756 transitions. [2024-11-10 04:04:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 756 transitions. [2024-11-10 04:04:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:04:44,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:44,951 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:44,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:04:44,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:44,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1883646950, now seen corresponding path program 1 times [2024-11-10 04:04:44,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:44,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942418657] [2024-11-10 04:04:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:44,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 51 proven. 117 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2024-11-10 04:04:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942418657] [2024-11-10 04:04:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942418657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:04:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369263089] [2024-11-10 04:04:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:46,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:04:46,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:04:46,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:04:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:46,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 04:04:46,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:04:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 740 proven. 120 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2024-11-10 04:04:48,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:04:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 48 proven. 123 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-10 04:04:49,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369263089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:04:49,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:04:49,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2024-11-10 04:04:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057637924] [2024-11-10 04:04:49,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:04:49,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 04:04:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 04:04:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2024-11-10 04:04:49,573 INFO L87 Difference]: Start difference. First operand 526 states and 756 transitions. Second operand has 27 states, 26 states have (on average 4.615384615384615) internal successors, (120), 25 states have internal predecessors, (120), 9 states have call successors, (90), 4 states have call predecessors, (90), 8 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) [2024-11-10 04:04:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:53,326 INFO L93 Difference]: Finished difference Result 838 states and 1137 transitions. [2024-11-10 04:04:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-10 04:04:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.615384615384615) internal successors, (120), 25 states have internal predecessors, (120), 9 states have call successors, (90), 4 states have call predecessors, (90), 8 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) Word has length 190 [2024-11-10 04:04:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:53,335 INFO L225 Difference]: With dead ends: 838 [2024-11-10 04:04:53,336 INFO L226 Difference]: Without dead ends: 533 [2024-11-10 04:04:53,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1468, Invalid=3934, Unknown=0, NotChecked=0, Total=5402 [2024-11-10 04:04:53,342 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 950 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:53,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 483 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 04:04:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-10 04:04:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 368. [2024-11-10 04:04:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 223 states have (on average 1.1031390134529149) internal successors, (246), 224 states have internal predecessors, (246), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-10 04:04:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2024-11-10 04:04:53,422 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 190 [2024-11-10 04:04:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:53,423 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2024-11-10 04:04:53,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.615384615384615) internal successors, (120), 25 states have internal predecessors, (120), 9 states have call successors, (90), 4 states have call predecessors, (90), 8 states have return successors, (90), 9 states have call predecessors, (90), 9 states have call successors, (90) [2024-11-10 04:04:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2024-11-10 04:04:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:04:53,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:53,425 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:53,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:04:53,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 04:04:53,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 843075709, now seen corresponding path program 1 times [2024-11-10 04:04:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504467842] [2024-11-10 04:04:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 04:04:54,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504467842] [2024-11-10 04:04:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504467842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:04:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366142402] [2024-11-10 04:04:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:54,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:54,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:04:54,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:04:54,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 04:04:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:54,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:04:54,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:04:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 143 proven. 84 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-11-10 04:04:54,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:04:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 04:04:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366142402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:04:54,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:04:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-10 04:04:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288805719] [2024-11-10 04:04:54,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:04:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 04:04:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:54,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 04:04:54,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:04:54,913 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-11-10 04:04:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:55,589 INFO L93 Difference]: Finished difference Result 823 states and 1069 transitions. [2024-11-10 04:04:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 04:04:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 190 [2024-11-10 04:04:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:55,595 INFO L225 Difference]: With dead ends: 823 [2024-11-10 04:04:55,595 INFO L226 Difference]: Without dead ends: 538 [2024-11-10 04:04:55,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 434 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:04:55,597 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 118 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:55,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 488 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:04:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-10 04:04:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 362. [2024-11-10 04:04:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 217 states have (on average 1.087557603686636) internal successors, (236), 217 states have internal predecessors, (236), 120 states have call successors, (120), 24 states have call predecessors, (120), 24 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 04:04:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 476 transitions. [2024-11-10 04:04:55,676 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 476 transitions. Word has length 190 [2024-11-10 04:04:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:55,677 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 476 transitions. [2024-11-10 04:04:55,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-11-10 04:04:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 476 transitions. [2024-11-10 04:04:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:04:55,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:55,680 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:55,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 04:04:55,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:55,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:55,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:55,881 INFO L85 PathProgramCache]: Analyzing trace with hash 871704860, now seen corresponding path program 1 times [2024-11-10 04:04:55,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:55,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734484651] [2024-11-10 04:04:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:04:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:04:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:04:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:04:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:04:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:04:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:04:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:04:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:04:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:04:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:04:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:04:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:04:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:04:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:04:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:04:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:04:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:04:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:04:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:04:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:04:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:04:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:04:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:04:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:04:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:04:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:04:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 04:04:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:04:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 04:04:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:04:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:04:56,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:04:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734484651] [2024-11-10 04:04:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734484651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:04:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:04:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:04:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126032051] [2024-11-10 04:04:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:04:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:04:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:04:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:04:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:04:56,212 INFO L87 Difference]: Start difference. First operand 362 states and 476 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:04:56,336 INFO L93 Difference]: Finished difference Result 555 states and 729 transitions. [2024-11-10 04:04:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:04:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-10 04:04:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:04:56,341 INFO L225 Difference]: With dead ends: 555 [2024-11-10 04:04:56,341 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 04:04:56,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 04:04:56,343 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:04:56,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:04:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 04:04:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-10 04:04:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 159 states have (on average 1.069182389937107) internal successors, (170), 159 states have internal predecessors, (170), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 04:04:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 350 transitions. [2024-11-10 04:04:56,400 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 350 transitions. Word has length 190 [2024-11-10 04:04:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:04:56,401 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 350 transitions. [2024-11-10 04:04:56,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:04:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 350 transitions. [2024-11-10 04:04:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 04:04:56,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:04:56,405 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:56,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 04:04:56,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:04:56,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:04:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1856470486, now seen corresponding path program 1 times [2024-11-10 04:04:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:04:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869296803] [2024-11-10 04:04:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:04:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:04:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420447539] [2024-11-10 04:04:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:04:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:04:56,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:04:56,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 04:04:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:04:56,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:04:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:04:56,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:04:56,816 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:04:56,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:04:56,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 04:04:57,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:04:57,024 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:04:57,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:04:57,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:04:57 BoogieIcfgContainer [2024-11-10 04:04:57,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:04:57,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:04:57,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:04:57,164 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:04:57,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:04:32" (3/4) ... [2024-11-10 04:04:57,166 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:04:57,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:04:57,168 INFO L158 Benchmark]: Toolchain (without parser) took 26378.72ms. Allocated memory was 165.7MB in the beginning and 509.6MB in the end (delta: 343.9MB). Free memory was 109.1MB in the beginning and 244.0MB in the end (delta: -135.0MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. [2024-11-10 04:04:57,168 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:04:57,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.20ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 91.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 04:04:57,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.26ms. Allocated memory is still 165.7MB. Free memory was 91.9MB in the beginning and 88.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:04:57,169 INFO L158 Benchmark]: Boogie Preprocessor took 68.33ms. Allocated memory is still 165.7MB. Free memory was 88.6MB in the beginning and 84.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:04:57,170 INFO L158 Benchmark]: IcfgBuilder took 802.57ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 84.4MB in the beginning and 207.7MB in the end (delta: -123.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-10 04:04:57,170 INFO L158 Benchmark]: TraceAbstraction took 24969.05ms. Allocated memory was 243.3MB in the beginning and 509.6MB in the end (delta: 266.3MB). Free memory was 207.7MB in the beginning and 244.0MB in the end (delta: -36.4MB). Peak memory consumption was 228.9MB. Max. memory is 16.1GB. [2024-11-10 04:04:57,170 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 509.6MB. Free memory is still 244.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:04:57,172 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.11ms. Allocated memory is still 165.7MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.20ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 91.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.26ms. Allocated memory is still 165.7MB. Free memory was 91.9MB in the beginning and 88.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.33ms. Allocated memory is still 165.7MB. Free memory was 88.6MB in the beginning and 84.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 802.57ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 84.4MB in the beginning and 207.7MB in the end (delta: -123.3MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24969.05ms. Allocated memory was 243.3MB in the beginning and 509.6MB in the end (delta: 266.3MB). Free memory was 207.7MB in the beginning and 244.0MB in the end (delta: -36.4MB). Peak memory consumption was 228.9MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 509.6MB. Free memory is still 244.0MB. 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 someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] unsigned short int var_1_27 = 256; [L44] unsigned char var_1_28 = 0; [L45] unsigned short int var_1_29 = 39250; [L46] unsigned short int var_1_30 = 256; [L47] unsigned short int var_1_31 = 25; [L48] unsigned short int var_1_32 = 4; [L49] signed char var_1_33 = -8; [L50] signed char var_1_34 = -2; [L51] unsigned short int last_1_var_1_6 = 4; [L52] unsigned short int last_1_var_1_9 = 4; [L53] unsigned long int last_1_var_1_14 = 500; [L54] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L161] last_1_var_1_6 = var_1_6 [L162] last_1_var_1_9 = var_1_9 [L163] last_1_var_1_14 = var_1_14 [L164] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] var_1_10 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] var_1_12 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L123] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L124] var_1_13 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L125] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_19 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] var_1_22 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] var_1_24 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_28 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_29 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_30 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] var_1_31 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_23 [L60] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=256, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L61] COND TRUE \read(var_1_28) [L62] var_1_27 = (((((var_1_29 - var_1_30)) < (var_1_31)) ? ((var_1_29 - var_1_30)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] var_1_32 = var_1_30 [L65] var_1_33 = var_1_24 [L66] var_1_34 = var_1_24 [L67] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L74] COND TRUE last_1_var_1_14 >= stepLocal_3 [L75] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] COND TRUE (- var_1_14) > var_1_6 [L79] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L84] unsigned char stepLocal_2 = var_1_4; [L85] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] COND TRUE stepLocal_1 >= var_1_6 [L90] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L95] unsigned char stepLocal_5 = var_1_1; [L96] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L97] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L104] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L105] COND TRUE ! var_1_1 [L106] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=1, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1728 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1724 mSDsluCounter, 3235 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2032 mSDsCounter, 1019 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2028 IncrementalHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1019 mSolverCounterUnsat, 1203 mSDtfsCounter, 2028 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 1715 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=526occurred in iteration=6, InterpolantAutomatonStates: 107, 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, 9 MinimizatonAttempts, 523 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2657 NumberOfCodeBlocks, 2657 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2830 ConstructedInterpolants, 0 QuantifiedInterpolants, 15482 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1350 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 25254/26100 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 04:04:57,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:04:59,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:04:59,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:04:59,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:04:59,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:04:59,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:04:59,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:04:59,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:04:59,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:04:59,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:04:59,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:04:59,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:04:59,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:04:59,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:04:59,696 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:04:59,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:04:59,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:04:59,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:04:59,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:04:59,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:04:59,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:04:59,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:04:59,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:04:59,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:04:59,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:04:59,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:04:59,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:04:59,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:04:59,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:04:59,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:04:59,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:04:59,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:04:59,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:04:59,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:04:59,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:04:59,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:04:59,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:04:59,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:04:59,709 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:04:59,709 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:04:59,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:04:59,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:04:59,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:04:59,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:04:59,711 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-11-10 04:05:00,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:05:00,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:05:00,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:05:00,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:05:00,107 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:05:00,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-10 04:05:01,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:05:02,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:05:02,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-10 04:05:02,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ead8a3a4/460c2fca77a94a8186f6d863422c9d00/FLAG9b4e675bd [2024-11-10 04:05:02,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ead8a3a4/460c2fca77a94a8186f6d863422c9d00 [2024-11-10 04:05:02,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:05:02,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:05:02,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:02,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:05:02,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:05:02,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73779ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02, skipping insertion in model container [2024-11-10 04:05:02,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:05:02,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-10 04:05:02,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:02,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:05:02,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-10 04:05:02,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:02,812 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:05:02,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02 WrapperNode [2024-11-10 04:05:02,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:02,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:02,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:05:02,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:05:02,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,867 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-10 04:05:02,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:02,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:05:02,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:05:02,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:05:02,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,914 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 04:05:02,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:05:02,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:05:02,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:05:02,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:05:02,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (1/1) ... [2024-11-10 04:05:02,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:05:03,004 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 04:05:03,008 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 04:05:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:05:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:05:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:05:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:05:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:05:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:05:03,171 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:05:03,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:05:04,109 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 04:05:04,110 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:05:04,124 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:05:04,125 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:05:04,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:04 BoogieIcfgContainer [2024-11-10 04:05:04,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:05:04,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:05:04,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:05:04,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:05:04,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:05:02" (1/3) ... [2024-11-10 04:05:04,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8cf364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:05:04, skipping insertion in model container [2024-11-10 04:05:04,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:02" (2/3) ... [2024-11-10 04:05:04,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8cf364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:05:04, skipping insertion in model container [2024-11-10 04:05:04,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:04" (3/3) ... [2024-11-10 04:05:04,135 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-10 04:05:04,152 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:05:04,152 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:05:04,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:05:04,236 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;@b8706c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:05:04,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:05:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 04:05:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 04:05:04,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:04,257 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:04,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:04,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1084263143, now seen corresponding path program 1 times [2024-11-10 04:05:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:05:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136345546] [2024-11-10 04:05:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:04,282 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 04:05:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:05:04,285 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 04:05:04,287 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 04:05:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:04,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:05:04,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2024-11-10 04:05:04,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:05:04,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:05:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136345546] [2024-11-10 04:05:04,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136345546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:04,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:04,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:05:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862864523] [2024-11-10 04:05:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:04,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:05:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:05:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:05:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:05:04,751 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 04:05:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:04,787 INFO L93 Difference]: Finished difference Result 160 states and 279 transitions. [2024-11-10 04:05:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:05:04,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-11-10 04:05:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:04,797 INFO L225 Difference]: With dead ends: 160 [2024-11-10 04:05:04,797 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 04:05:04,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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 04:05:04,803 INFO L432 NwaCegarLoop]: 119 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, 119 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 04:05:04,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:05:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 04:05:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 04:05:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 04:05:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-11-10 04:05:04,862 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 188 [2024-11-10 04:05:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:04,862 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-11-10 04:05:04,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 04:05:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-11-10 04:05:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 04:05:04,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:04,868 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:04,882 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 04:05:05,076 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 04:05:05,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:05,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1506766452, now seen corresponding path program 1 times [2024-11-10 04:05:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:05:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444138248] [2024-11-10 04:05:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:05,079 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 04:05:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:05:05,083 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 04:05:05,084 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 04:05:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:05,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:05:05,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 279 proven. 159 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2024-11-10 04:05:06,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:05:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 162 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-10 04:05:07,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:05:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444138248] [2024-11-10 04:05:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444138248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:05:07,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:05:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-10 04:05:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203432085] [2024-11-10 04:05:07,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:05:07,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 04:05:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:05:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 04:05:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 04:05:07,489 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-10 04:05:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:08,828 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-11-10 04:05:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 04:05:08,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 189 [2024-11-10 04:05:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:08,834 INFO L225 Difference]: With dead ends: 183 [2024-11-10 04:05:08,835 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 04:05:08,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:05:08,837 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 149 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:05:08,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 305 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 04:05:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 04:05:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2024-11-10 04:05:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 04:05:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-11-10 04:05:08,869 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 189 [2024-11-10 04:05:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:08,871 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-11-10 04:05:08,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-10 04:05:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-11-10 04:05:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:05:08,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:08,878 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:08,889 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 04:05:09,082 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 04:05:09,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:09,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1687133445, now seen corresponding path program 1 times [2024-11-10 04:05:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:05:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569163121] [2024-11-10 04:05:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:09,088 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 04:05:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:05:09,092 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 04:05:09,094 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 04:05:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:09,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:05:09,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:05:09,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:05:09,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:05:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569163121] [2024-11-10 04:05:09,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569163121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:09,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:05:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249717439] [2024-11-10 04:05:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:09,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:05:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:05:09,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:05:09,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:05:09,873 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:05:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:10,734 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2024-11-10 04:05:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:05:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-10 04:05:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:10,740 INFO L225 Difference]: With dead ends: 260 [2024-11-10 04:05:10,740 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 04:05:10,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:05:10,744 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 136 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:05:10,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 300 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 04:05:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 04:05:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2024-11-10 04:05:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.107843137254902) internal successors, (113), 102 states have internal predecessors, (113), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:05:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2024-11-10 04:05:10,784 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 233 transitions. Word has length 190 [2024-11-10 04:05:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:10,785 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 233 transitions. [2024-11-10 04:05:10,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:05:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 233 transitions. [2024-11-10 04:05:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:05:10,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:10,789 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:10,801 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 04:05:10,989 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 04:05:10,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:10,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1883646950, now seen corresponding path program 1 times [2024-11-10 04:05:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:05:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757807920] [2024-11-10 04:05:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:10,992 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 04:05:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:05:10,993 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 04:05:10,994 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 04:05:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:11,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:05:11,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 63 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-10 04:05:13,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:05:13,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:05:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757807920] [2024-11-10 04:05:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757807920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:05:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1657077800] [2024-11-10 04:05:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 04:05:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 04:05:13,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 04:05:13,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 04:05:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:13,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 04:05:13,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 117 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 04:05:15,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:05:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1657077800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:05:16,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:05:16,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-10 04:05:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306038065] [2024-11-10 04:05:16,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:05:16,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 04:05:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:05:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 04:05:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-10 04:05:16,363 INFO L87 Difference]: Start difference. First operand 169 states and 233 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-10 04:05:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:20,634 INFO L93 Difference]: Finished difference Result 459 states and 613 transitions. [2024-11-10 04:05:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 04:05:20,636 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 190 [2024-11-10 04:05:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:20,641 INFO L225 Difference]: With dead ends: 459 [2024-11-10 04:05:20,641 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 04:05:20,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 04:05:20,643 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 351 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 04:05:20,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 549 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 04:05:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 04:05:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 272. [2024-11-10 04:05:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 166 states have (on average 1.0903614457831325) internal successors, (181), 166 states have internal predecessors, (181), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 04:05:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 361 transitions. [2024-11-10 04:05:20,708 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 361 transitions. Word has length 190 [2024-11-10 04:05:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:20,710 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 361 transitions. [2024-11-10 04:05:20,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-10 04:05:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 361 transitions. [2024-11-10 04:05:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 04:05:20,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:20,715 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:20,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 04:05:20,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-10 04:05:21,116 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 04:05:21,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:21,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1905761721, now seen corresponding path program 1 times [2024-11-10 04:05:21,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:05:21,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273939597] [2024-11-10 04:05:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:21,118 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 04:05:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:05:21,122 INFO L229 MonitoredProcess]: Starting monitored process 7 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 04:05:21,130 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 (7)] Waiting until timeout for monitored process [2024-11-10 04:05:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:21,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:05:21,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 04:05:22,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:05:22,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:05:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273939597] [2024-11-10 04:05:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273939597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:22,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:22,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:05:22,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375372028] [2024-11-10 04:05:22,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:22,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:05:22,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:05:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:05:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:05:22,198 INFO L87 Difference]: Start difference. First operand 272 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:05:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:23,235 INFO L93 Difference]: Finished difference Result 454 states and 599 transitions. [2024-11-10 04:05:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:05:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-11-10 04:05:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:23,252 INFO L225 Difference]: With dead ends: 454 [2024-11-10 04:05:23,252 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 04:05:23,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 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 04:05:23,254 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 50 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:05:23,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 342 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 04:05:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 04:05:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 167. [2024-11-10 04:05:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:05:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 221 transitions. [2024-11-10 04:05:23,292 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 221 transitions. Word has length 190 [2024-11-10 04:05:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:23,292 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 221 transitions. [2024-11-10 04:05:23,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-10 04:05:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 221 transitions. [2024-11-10 04:05:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 04:05:23,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:23,296 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:23,306 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 (7)] Ended with exit code 0 [2024-11-10 04:05:23,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 04:05:23,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:23,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1856470486, now seen corresponding path program 1 times [2024-11-10 04:05:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:05:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634747763] [2024-11-10 04:05:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:23,498 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 04:05:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:05:23,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:05:23,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 04:05:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:23,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 04:05:23,706 INFO L278 TraceCheckSpWp]: Computing forward predicates...