./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.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 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:34:24,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:34:24,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:34:24,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:34:24,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:34:24,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:34:24,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:34:24,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:34:24,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:34:24,868 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:34:24,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:34:24,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:34:24,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:34:24,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:34:24,871 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:34:24,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:34:24,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:34:24,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:34:24,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:34:24,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:34:24,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:34:24,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:34:24,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:34:24,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:34:24,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:34:24,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:34:24,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:34:24,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:34:24,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:34:24,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:34:24,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:34:24,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:34:24,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:34:24,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:34:24,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:34:24,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:34:24,878 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 -> 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 [2024-10-24 07:34:25,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:34:25,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:34:25,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:34:25,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:34:25,105 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:34:25,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2024-10-24 07:34:26,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:34:26,411 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:34:26,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2024-10-24 07:34:26,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4247bc260/991ddb0eea7f4db9b531bd749d631865/FLAG519bd3542 [2024-10-24 07:34:26,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4247bc260/991ddb0eea7f4db9b531bd749d631865 [2024-10-24 07:34:26,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:34:26,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:34:26,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:34:26,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:34:26,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:34:26,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395ce8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26, skipping insertion in model container [2024-10-24 07:34:26,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:34:26,626 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2024-10-24 07:34:26,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:34:26,704 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:34:26,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2024-10-24 07:34:26,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:34:26,760 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:34:26,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26 WrapperNode [2024-10-24 07:34:26,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:34:26,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:34:26,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:34:26,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:34:26,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,801 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-24 07:34:26,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:34:26,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:34:26,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:34:26,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:34:26,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,834 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-10-24 07:34:26,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:34:26,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:34:26,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:34:26,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:34:26,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (1/1) ... [2024-10-24 07:34:26,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:34:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:34:26,890 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-10-24 07:34:26,893 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-10-24 07:34:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:34:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:34:26,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:34:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:34:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:34:26,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:34:27,000 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:34:27,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:34:27,275 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 07:34:27,275 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:34:27,312 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:34:27,312 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:34:27,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:27 BoogieIcfgContainer [2024-10-24 07:34:27,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:34:27,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:34:27,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:34:27,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:34:27,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:34:26" (1/3) ... [2024-10-24 07:34:27,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b87dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:34:27, skipping insertion in model container [2024-10-24 07:34:27,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:26" (2/3) ... [2024-10-24 07:34:27,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b87dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:34:27, skipping insertion in model container [2024-10-24 07:34:27,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:27" (3/3) ... [2024-10-24 07:34:27,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2024-10-24 07:34:27,332 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:34:27,332 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:34:27,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:34:27,392 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;@306529cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:34:27,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:34:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:34:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:34:27,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:27,410 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:27,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:27,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 300072885, now seen corresponding path program 1 times [2024-10-24 07:34:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:27,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631154129] [2024-10-24 07:34:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631154129] [2024-10-24 07:34:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631154129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:34:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:34:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036006936] [2024-10-24 07:34:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:27,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:34:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:34:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:34:27,832 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:34:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:27,873 INFO L93 Difference]: Finished difference Result 172 states and 311 transitions. [2024-10-24 07:34:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:34:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 192 [2024-10-24 07:34:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:27,899 INFO L225 Difference]: With dead ends: 172 [2024-10-24 07:34:27,900 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 07:34:27,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-10-24 07:34:27,911 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:27,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:34:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 07:34:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 07:34:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:34:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-10-24 07:34:27,972 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 192 [2024-10-24 07:34:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:27,972 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-10-24 07:34:27,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:34:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-10-24 07:34:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:34:27,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:27,975 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:27,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:34:27,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1545698415, now seen corresponding path program 1 times [2024-10-24 07:34:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833763814] [2024-10-24 07:34:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833763814] [2024-10-24 07:34:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833763814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:34:28,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:34:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869364192] [2024-10-24 07:34:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:34:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:28,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:34:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:34:28,293 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:28,487 INFO L93 Difference]: Finished difference Result 216 states and 339 transitions. [2024-10-24 07:34:28,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:34:28,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2024-10-24 07:34:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:28,490 INFO L225 Difference]: With dead ends: 216 [2024-10-24 07:34:28,492 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 07:34:28,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:34:28,494 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 67 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:28,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 379 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:34:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 07:34:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-10-24 07:34:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 07:34:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2024-10-24 07:34:28,521 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 202 transitions. Word has length 192 [2024-10-24 07:34:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:28,523 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 202 transitions. [2024-10-24 07:34:28,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 202 transitions. [2024-10-24 07:34:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:34:28,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:28,528 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:28,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:34:28,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2069210511, now seen corresponding path program 1 times [2024-10-24 07:34:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631415296] [2024-10-24 07:34:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631415296] [2024-10-24 07:34:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631415296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:34:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:34:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512673379] [2024-10-24 07:34:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:28,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:34:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:34:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:34:28,990 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:29,133 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2024-10-24 07:34:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:34:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2024-10-24 07:34:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:29,137 INFO L225 Difference]: With dead ends: 359 [2024-10-24 07:34:29,138 INFO L226 Difference]: Without dead ends: 230 [2024-10-24 07:34:29,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-10-24 07:34:29,139 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 93 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:29,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 374 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:34:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-24 07:34:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2024-10-24 07:34:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 100 states have (on average 1.26) internal successors, (126), 101 states have internal predecessors, (126), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:34:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 286 transitions. [2024-10-24 07:34:29,173 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 286 transitions. Word has length 192 [2024-10-24 07:34:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:29,174 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 286 transitions. [2024-10-24 07:34:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 286 transitions. [2024-10-24 07:34:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:34:29,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:29,176 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:29,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:34:29,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:29,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash 231612079, now seen corresponding path program 1 times [2024-10-24 07:34:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480670434] [2024-10-24 07:34:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480670434] [2024-10-24 07:34:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480670434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:34:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:34:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763017287] [2024-10-24 07:34:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:29,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:34:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:29,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:34:29,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:34:29,473 INFO L87 Difference]: Start difference. First operand 184 states and 286 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:29,566 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2024-10-24 07:34:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:34:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2024-10-24 07:34:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:29,568 INFO L225 Difference]: With dead ends: 391 [2024-10-24 07:34:29,568 INFO L226 Difference]: Without dead ends: 262 [2024-10-24 07:34:29,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-10-24 07:34:29,573 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 153 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:29,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 424 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:34:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-24 07:34:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 202. [2024-10-24 07:34:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:34:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2024-10-24 07:34:29,594 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 192 [2024-10-24 07:34:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:29,595 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2024-10-24 07:34:29,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2024-10-24 07:34:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:34:29,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:29,597 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:29,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:34:29,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:29,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1356735823, now seen corresponding path program 1 times [2024-10-24 07:34:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530460651] [2024-10-24 07:34:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:34:29,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:29,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530460651] [2024-10-24 07:34:29,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530460651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:34:29,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398337989] [2024-10-24 07:34:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:34:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:34:29,936 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-10-24 07:34:29,936 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-10-24 07:34:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:30,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:34:30,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 926 proven. 60 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-10-24 07:34:30,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:34:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:34:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398337989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:34:30,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:34:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-10-24 07:34:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639385143] [2024-10-24 07:34:30,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:34:30,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 07:34:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:30,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 07:34:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 07:34:30,758 INFO L87 Difference]: Start difference. First operand 202 states and 315 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 7 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2024-10-24 07:34:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:31,205 INFO L93 Difference]: Finished difference Result 476 states and 700 transitions. [2024-10-24 07:34:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 07:34:31,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 7 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) Word has length 192 [2024-10-24 07:34:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:31,211 INFO L225 Difference]: With dead ends: 476 [2024-10-24 07:34:31,211 INFO L226 Difference]: Without dead ends: 334 [2024-10-24 07:34:31,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2024-10-24 07:34:31,215 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 202 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:31,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 276 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:34:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-24 07:34:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 320. [2024-10-24 07:34:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 212 states have internal predecessors, (266), 96 states have call successors, (96), 14 states have call predecessors, (96), 14 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-24 07:34:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 458 transitions. [2024-10-24 07:34:31,251 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 458 transitions. Word has length 192 [2024-10-24 07:34:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:31,252 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 458 transitions. [2024-10-24 07:34:31,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 7 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2024-10-24 07:34:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 458 transitions. [2024-10-24 07:34:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 07:34:31,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:31,254 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:31,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:34:31,455 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-10-24 07:34:31,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:31,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1299477521, now seen corresponding path program 1 times [2024-10-24 07:34:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686595981] [2024-10-24 07:34:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:34:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686595981] [2024-10-24 07:34:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686595981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:34:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073550055] [2024-10-24 07:34:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:31,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:34:31,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:34:31,857 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-10-24 07:34:31,858 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-10-24 07:34:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:31,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 07:34:31,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-10-24 07:34:32,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:34:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 54 proven. 123 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-10-24 07:34:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073550055] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:34:32,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:34:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-10-24 07:34:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521253942] [2024-10-24 07:34:32,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:34:32,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 07:34:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 07:34:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-24 07:34:32,717 INFO L87 Difference]: Start difference. First operand 320 states and 458 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (75), 3 states have call predecessors, (75), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-10-24 07:34:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:33,189 INFO L93 Difference]: Finished difference Result 503 states and 698 transitions. [2024-10-24 07:34:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 07:34:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (75), 3 states have call predecessors, (75), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 192 [2024-10-24 07:34:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:33,192 INFO L225 Difference]: With dead ends: 503 [2024-10-24 07:34:33,192 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 07:34:33,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2024-10-24 07:34:33,193 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 192 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:33,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 241 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:34:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 07:34:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 227. [2024-10-24 07:34:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 143 states have (on average 1.2097902097902098) internal successors, (173), 144 states have internal predecessors, (173), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 07:34:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2024-10-24 07:34:33,215 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 192 [2024-10-24 07:34:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:33,216 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2024-10-24 07:34:33,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (75), 3 states have call predecessors, (75), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2024-10-24 07:34:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2024-10-24 07:34:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:34:33,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:33,217 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:33,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:34:33,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 07:34:33,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -788304444, now seen corresponding path program 1 times [2024-10-24 07:34:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723205493] [2024-10-24 07:34:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:34:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723205493] [2024-10-24 07:34:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723205493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:34:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109209651] [2024-10-24 07:34:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:33,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:34:33,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:34:33,612 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-10-24 07:34:33,613 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-10-24 07:34:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:33,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:34:33,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 720 proven. 21 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2024-10-24 07:34:33,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:34:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:34:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109209651] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:34:33,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:34:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 07:34:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475399735] [2024-10-24 07:34:33,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:34:33,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:34:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:34:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:34:33,939 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 07:34:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:34,105 INFO L93 Difference]: Finished difference Result 392 states and 535 transitions. [2024-10-24 07:34:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:34:34,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 194 [2024-10-24 07:34:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:34,107 INFO L225 Difference]: With dead ends: 392 [2024-10-24 07:34:34,107 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 07:34:34,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:34:34,109 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 74 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:34,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 202 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:34:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 07:34:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2024-10-24 07:34:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 149 states have (on average 1.1879194630872483) internal successors, (177), 150 states have internal predecessors, (177), 70 states have call successors, (70), 15 states have call predecessors, (70), 15 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 07:34:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 317 transitions. [2024-10-24 07:34:34,134 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 317 transitions. Word has length 194 [2024-10-24 07:34:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:34,135 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 317 transitions. [2024-10-24 07:34:34,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 07:34:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 317 transitions. [2024-10-24 07:34:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:34:34,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:34,159 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:34,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 07:34:34,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:34:34,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:34,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2068168122, now seen corresponding path program 1 times [2024-10-24 07:34:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948184873] [2024-10-24 07:34:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:34:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:34:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:34:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:34:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:34:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:34:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:34:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:34:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:34:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:34:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:34:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:34:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:34:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:34:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:34:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:34:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:34:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:34:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:34:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:34:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:34:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:34:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 07:34:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:34:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 07:34:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 07:34:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 07:34:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:34:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 07:34:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:34:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 07:34:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 90 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2024-10-24 07:34:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:34:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948184873] [2024-10-24 07:34:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948184873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:34:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697637124] [2024-10-24 07:34:34,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:34:34,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:34:34,798 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-10-24 07:34:34,799 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-10-24 07:34:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:34,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 07:34:34,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1218 proven. 141 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2024-10-24 07:34:35,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:34:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 93 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-10-24 07:34:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697637124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:34:36,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:34:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 26 [2024-10-24 07:34:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002173111] [2024-10-24 07:34:36,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:34:36,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 07:34:36,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:34:36,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 07:34:36,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-10-24 07:34:36,163 INFO L87 Difference]: Start difference. First operand 235 states and 317 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 25 states have internal predecessors, (139), 10 states have call successors, (93), 5 states have call predecessors, (93), 10 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) [2024-10-24 07:34:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:38,602 INFO L93 Difference]: Finished difference Result 1060 states and 1408 transitions. [2024-10-24 07:34:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-10-24 07:34:38,603 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 25 states have internal predecessors, (139), 10 states have call successors, (93), 5 states have call predecessors, (93), 10 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) Word has length 194 [2024-10-24 07:34:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:38,607 INFO L225 Difference]: With dead ends: 1060 [2024-10-24 07:34:38,607 INFO L226 Difference]: Without dead ends: 921 [2024-10-24 07:34:38,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1673, Invalid=5637, Unknown=0, NotChecked=0, Total=7310 [2024-10-24 07:34:38,610 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 607 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:38,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 894 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 07:34:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-10-24 07:34:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 534. [2024-10-24 07:34:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 350 states have (on average 1.1885714285714286) internal successors, (416), 353 states have internal predecessors, (416), 148 states have call successors, (148), 35 states have call predecessors, (148), 35 states have return successors, (148), 145 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-24 07:34:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 712 transitions. [2024-10-24 07:34:38,678 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 712 transitions. Word has length 194 [2024-10-24 07:34:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:38,679 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 712 transitions. [2024-10-24 07:34:38,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 25 states have internal predecessors, (139), 10 states have call successors, (93), 5 states have call predecessors, (93), 10 states have return successors, (93), 10 states have call predecessors, (93), 10 states have call successors, (93) [2024-10-24 07:34:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 712 transitions. [2024-10-24 07:34:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 07:34:38,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:38,681 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:38,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 07:34:38,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:34:38,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:38,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2066321080, now seen corresponding path program 1 times [2024-10-24 07:34:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:34:38,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048465172] [2024-10-24 07:34:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:34:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:34:38,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:34:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:34:39,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:34:39,006 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:34:39,006 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:34:39,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 07:34:39,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:34:39,116 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:34:39,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:34:39 BoogieIcfgContainer [2024-10-24 07:34:39,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:34:39,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:34:39,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:34:39,119 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:34:39,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:27" (3/4) ... [2024-10-24 07:34:39,121 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:34:39,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:34:39,122 INFO L158 Benchmark]: Toolchain (without parser) took 12690.20ms. Allocated memory was 130.0MB in the beginning and 383.8MB in the end (delta: 253.8MB). Free memory was 59.6MB in the beginning and 267.1MB in the end (delta: -207.6MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-10-24 07:34:39,122 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:34:39,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.16ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 59.2MB in the beginning and 164.6MB in the end (delta: -105.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-24 07:34:39,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.42ms. Allocated memory is still 203.4MB. Free memory was 164.6MB in the beginning and 161.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:34:39,123 INFO L158 Benchmark]: Boogie Preprocessor took 56.09ms. Allocated memory is still 203.4MB. Free memory was 161.3MB in the beginning and 155.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:34:39,123 INFO L158 Benchmark]: RCFGBuilder took 449.88ms. Allocated memory is still 203.4MB. Free memory was 155.1MB in the beginning and 125.7MB in the end (delta: 29.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 07:34:39,123 INFO L158 Benchmark]: TraceAbstraction took 11803.16ms. Allocated memory was 203.4MB in the beginning and 383.8MB in the end (delta: 180.4MB). Free memory was 124.8MB in the beginning and 267.1MB in the end (delta: -142.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-24 07:34:39,123 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 383.8MB. Free memory is still 267.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:34:39,124 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.31ms. Allocated memory is still 130.0MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.16ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 59.2MB in the beginning and 164.6MB in the end (delta: -105.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.42ms. Allocated memory is still 203.4MB. Free memory was 164.6MB in the beginning and 161.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.09ms. Allocated memory is still 203.4MB. Free memory was 161.3MB in the beginning and 155.1MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 449.88ms. Allocated memory is still 203.4MB. Free memory was 155.1MB in the beginning and 125.7MB in the end (delta: 29.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11803.16ms. Allocated memory was 203.4MB in the beginning and 383.8MB in the end (delta: 180.4MB). Free memory was 124.8MB in the beginning and 267.1MB in the end (delta: -142.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 383.8MB. Free memory is still 267.1MB. 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 179, overapproximation of someBinaryFLOATComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned char var_1_40 = 1; [L46] unsigned char var_1_43 = 0; [L47] signed long int var_1_44 = -4; [L48] unsigned long int var_1_46 = 4; [L49] unsigned long int var_1_49 = 3576445681; [L50] double var_1_50 = 32.5; [L51] signed long int var_1_52 = -1; [L52] unsigned short int var_1_53 = 64; [L53] unsigned short int last_1_var_1_9 = 4; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L131] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L135] var_1_10 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L138] var_1_12 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L141] var_1_13 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L144] var_1_18 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L146] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L147] var_1_19 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L148] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L150] var_1_20 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L153] var_1_21 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L156] var_1_22 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L165] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L166] var_1_30 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L167] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L169] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L170] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L171] var_1_49 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_49 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L172] RET assume_abort_if_not(var_1_49 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_49 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L173] RET assume_abort_if_not(var_1_49 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L187] RET updateVariables() [L188] CALL step() [L57] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L60] COND FALSE !(var_1_21 <= var_1_9) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=50, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L63] var_1_50 = var_1_30 [L64] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L65] COND TRUE (var_1_13 <= var_1_12) || var_1_25 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L66] COND TRUE ((((5) < 0 ) ? -(5) : (5))) < var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L67] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L72] var_1_53 = var_1_22 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L73] COND TRUE \read(var_1_4) [L74] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L78] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=16, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L79] COND FALSE !(var_1_23 < var_1_23) [L90] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L92] EXPR (~ var_1_21) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L92] COND FALSE !(((~ var_1_21) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22)))) >= var_1_12) [L95] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L96] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L103] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L105] COND FALSE !((~ var_1_18) > var_1_13) [L108] var_1_52 = ((((var_1_10) < (var_1_21)) ? (var_1_10) : (var_1_21))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=4, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L110] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L113] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=4, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L115] COND FALSE !(((((4) < 0 ) ? -(4) : (4))) >= var_1_21) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=4, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=4, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=4, var_1_12=2684141566, var_1_13=-40961, var_1_17=-64, var_1_18=0, var_1_19=-1, var_1_1=126, var_1_20=0, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=4294967299, var_1_28=4294967299, var_1_30=4294967300, var_1_31=4294967300, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=4294967294, var_1_4=1, var_1_50=4294967300, var_1_52=4, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=-40961] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1446 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1388 mSDsluCounter, 2919 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1960 mSDsCounter, 678 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3452 IncrementalHoareTripleChecker+Invalid, 4130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 678 mSolverCounterUnsat, 959 mSDtfsCounter, 3452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2209 GetRequests, 2058 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2718 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=8, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 561 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2506 NumberOfCodeBlocks, 2506 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3068 ConstructedInterpolants, 0 QuantifiedInterpolants, 11811 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1727 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 28878/29760 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-10-24 07:34:39,168 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.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 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:34:40,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:34:40,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:34:40,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:34:40,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:34:40,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:34:40,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:34:40,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:34:40,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:34:40,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:34:40,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:34:40,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:34:40,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:34:40,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:34:40,998 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:34:40,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:34:40,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:34:41,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:34:41,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:34:41,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:34:41,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:34:41,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:34:41,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:34:41,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:34:41,002 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:34:41,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:34:41,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:34:41,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:34:41,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:34:41,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:34:41,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:34:41,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:34:41,004 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:34:41,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:34:41,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:34:41,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:34:41,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:34:41,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:34:41,007 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:34:41,007 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 -> 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 [2024-10-24 07:34:41,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:34:41,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:34:41,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:34:41,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:34:41,276 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:34:41,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2024-10-24 07:34:42,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:34:42,687 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:34:42,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2024-10-24 07:34:42,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b93e9251/35f0fa1c1d484792b88765cccda3988b/FLAG1c3269964 [2024-10-24 07:34:43,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b93e9251/35f0fa1c1d484792b88765cccda3988b [2024-10-24 07:34:43,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:34:43,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:34:43,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:34:43,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:34:43,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:34:43,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce03d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43, skipping insertion in model container [2024-10-24 07:34:43,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:34:43,227 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2024-10-24 07:34:43,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:34:43,314 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:34:43,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2024-10-24 07:34:43,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:34:43,396 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:34:43,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43 WrapperNode [2024-10-24 07:34:43,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:34:43,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:34:43,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:34:43,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:34:43,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,443 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-24 07:34:43,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:34:43,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:34:43,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:34:43,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:34:43,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,471 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-10-24 07:34:43,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:34:43,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:34:43,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:34:43,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:34:43,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (1/1) ... [2024-10-24 07:34:43,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:34:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:34:43,527 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-10-24 07:34:43,530 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-10-24 07:34:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:34:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:34:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:34:43,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:34:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:34:43,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:34:43,631 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:34:43,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:34:45,184 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 07:34:45,185 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:34:45,218 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:34:45,218 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:34:45,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:45 BoogieIcfgContainer [2024-10-24 07:34:45,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:34:45,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:34:45,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:34:45,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:34:45,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:34:43" (1/3) ... [2024-10-24 07:34:45,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121a91d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:34:45, skipping insertion in model container [2024-10-24 07:34:45,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:34:43" (2/3) ... [2024-10-24 07:34:45,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121a91d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:34:45, skipping insertion in model container [2024-10-24 07:34:45,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:34:45" (3/3) ... [2024-10-24 07:34:45,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2024-10-24 07:34:45,237 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:34:45,237 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:34:45,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:34:45,287 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;@64f29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:34:45,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:34:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:34:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:34:45,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:45,303 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:45,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:45,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash -787534868, now seen corresponding path program 1 times [2024-10-24 07:34:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:34:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429865264] [2024-10-24 07:34:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:45,317 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-10-24 07:34:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:34:45,320 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-10-24 07:34:45,338 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-10-24 07:34:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:45,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:34:45,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 924 proven. 0 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2024-10-24 07:34:45,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:34:45,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:34:45,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429865264] [2024-10-24 07:34:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429865264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:45,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:34:45,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:34:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738628558] [2024-10-24 07:34:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:34:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:34:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:34:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:34:45,702 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:34:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:46,614 INFO L93 Difference]: Finished difference Result 160 states and 291 transitions. [2024-10-24 07:34:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:34:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 191 [2024-10-24 07:34:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:46,639 INFO L225 Difference]: With dead ends: 160 [2024-10-24 07:34:46,639 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 07:34:46,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 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-10-24 07:34:46,644 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:46,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 07:34:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 07:34:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 07:34:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 07:34:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2024-10-24 07:34:46,676 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 191 [2024-10-24 07:34:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:46,676 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2024-10-24 07:34:46,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 07:34:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2024-10-24 07:34:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:34:46,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:46,679 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:46,688 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-10-24 07:34:46,883 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-10-24 07:34:46,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:46,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash 638119922, now seen corresponding path program 1 times [2024-10-24 07:34:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:34:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736434263] [2024-10-24 07:34:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:46,886 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-10-24 07:34:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:34:46,887 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-10-24 07:34:46,888 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-10-24 07:34:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:47,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 07:34:47,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:47,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:34:47,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:34:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736434263] [2024-10-24 07:34:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736434263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:47,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:34:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:34:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725804000] [2024-10-24 07:34:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:47,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:34:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:34:47,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:34:47,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:34:47,548 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:50,069 INFO L93 Difference]: Finished difference Result 233 states and 365 transitions. [2024-10-24 07:34:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:34:50,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-10-24 07:34:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:50,088 INFO L225 Difference]: With dead ends: 233 [2024-10-24 07:34:50,088 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 07:34:50,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-10-24 07:34:50,090 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 77 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:50,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 344 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 07:34:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 07:34:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2024-10-24 07:34:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 07:34:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 206 transitions. [2024-10-24 07:34:50,120 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 206 transitions. Word has length 191 [2024-10-24 07:34:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:50,122 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 206 transitions. [2024-10-24 07:34:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 206 transitions. [2024-10-24 07:34:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:34:50,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:50,127 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:50,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 07:34:50,328 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-10-24 07:34:50,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash -950227980, now seen corresponding path program 1 times [2024-10-24 07:34:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:34:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834565578] [2024-10-24 07:34:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:50,330 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-10-24 07:34:50,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:34:50,332 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-10-24 07:34:50,332 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-10-24 07:34:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:50,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:34:50,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-10-24 07:34:51,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:34:51,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:34:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834565578] [2024-10-24 07:34:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834565578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:34:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1179965791] [2024-10-24 07:34:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:34:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:34:51,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:34:51,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 07:34:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:51,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:34:51,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:52,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:34:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1179965791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:34:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 07:34:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460248052] [2024-10-24 07:34:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:52,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:34:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:34:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:34:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:34:52,021 INFO L87 Difference]: Start difference. First operand 132 states and 206 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:54,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:34:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:55,063 INFO L93 Difference]: Finished difference Result 253 states and 394 transitions. [2024-10-24 07:34:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:34:55,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-10-24 07:34:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:55,067 INFO L225 Difference]: With dead ends: 253 [2024-10-24 07:34:55,067 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 07:34:55,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:34:55,073 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 60 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:55,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 267 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 07:34:55,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 07:34:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-10-24 07:34:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 90 states have internal predecessors, (109), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:34:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2024-10-24 07:34:55,106 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 191 [2024-10-24 07:34:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:55,106 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2024-10-24 07:34:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2024-10-24 07:34:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:34:55,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:55,112 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:55,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 07:34:55,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-24 07:34:55,512 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 07:34:55,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:34:55,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:34:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash -270169610, now seen corresponding path program 1 times [2024-10-24 07:34:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:34:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531613026] [2024-10-24 07:34:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:55,514 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-10-24 07:34:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:34:55,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:34:55,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 07:34:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:55,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:34:55,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-10-24 07:34:56,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:34:56,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:34:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531613026] [2024-10-24 07:34:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531613026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:34:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [295259979] [2024-10-24 07:34:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:34:56,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:34:56,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:34:56,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:34:56,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-24 07:34:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:34:57,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 07:34:57,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:34:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 07:34:57,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:34:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [295259979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:34:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:34:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-10-24 07:34:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665061197] [2024-10-24 07:34:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:34:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:34:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:34:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:34:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:34:57,454 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:34:59,739 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2024-10-24 07:34:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:34:59,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-10-24 07:34:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:34:59,746 INFO L225 Difference]: With dead ends: 359 [2024-10-24 07:34:59,746 INFO L226 Difference]: Without dead ends: 241 [2024-10-24 07:34:59,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 07:34:59,747 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 107 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:34:59,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 415 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 07:34:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-24 07:34:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2024-10-24 07:34:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 106 states have internal predecessors, (135), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:34:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 295 transitions. [2024-10-24 07:34:59,782 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 295 transitions. Word has length 191 [2024-10-24 07:34:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:34:59,783 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 295 transitions. [2024-10-24 07:34:59,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 07:34:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 295 transitions. [2024-10-24 07:34:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 07:34:59,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:34:59,786 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:34:59,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-24 07:34:59,996 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 (6)] Ended with exit code 0 [2024-10-24 07:35:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:35:00,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:35:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:35:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1291237964, now seen corresponding path program 1 times [2024-10-24 07:35:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:35:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324709623] [2024-10-24 07:35:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:35:00,193 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-10-24 07:35:00,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:35:00,198 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-10-24 07:35:00,201 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-10-24 07:35:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:35:00,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:35:00,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:35:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-10-24 07:35:00,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:35:01,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:35:01,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324709623] [2024-10-24 07:35:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324709623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:35:01,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1952957322] [2024-10-24 07:35:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:35:01,196 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:35:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:35:01,199 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:35:01,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 07:35:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:35:01,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 07:35:01,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:35:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-10-24 07:35:01,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:35:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1952957322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:35:01,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:35:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2024-10-24 07:35:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803298589] [2024-10-24 07:35:01,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:35:01,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 07:35:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:35:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 07:35:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:35:01,971 INFO L87 Difference]: Start difference. First operand 189 states and 295 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-24 07:35:04,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:35:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:35:04,238 INFO L93 Difference]: Finished difference Result 353 states and 518 transitions. [2024-10-24 07:35:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 07:35:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 191 [2024-10-24 07:35:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:35:04,258 INFO L225 Difference]: With dead ends: 353 [2024-10-24 07:35:04,258 INFO L226 Difference]: Without dead ends: 224 [2024-10-24 07:35:04,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2024-10-24 07:35:04,259 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:35:04,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 261 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 07:35:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-24 07:35:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2024-10-24 07:35:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 125 states have (on average 1.144) internal successors, (143), 126 states have internal predecessors, (143), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:35:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2024-10-24 07:35:04,286 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 191 [2024-10-24 07:35:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:35:04,286 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2024-10-24 07:35:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-24 07:35:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2024-10-24 07:35:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 07:35:04,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:35:04,288 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:35:04,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-24 07:35:04,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 07:35:04,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-10-24 07:35:04,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:35:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:35:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 64425405, now seen corresponding path program 1 times [2024-10-24 07:35:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:35:04,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245960649] [2024-10-24 07:35:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:35:04,690 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-10-24 07:35:04,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:35:04,692 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-24 07:35:04,692 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 (10)] Waiting until timeout for monitored process [2024-10-24 07:35:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:35:04,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:35:04,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:35:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 720 proven. 21 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2024-10-24 07:35:05,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:35:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 07:35:05,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:35:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245960649] [2024-10-24 07:35:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245960649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:35:05,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:35:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 07:35:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082526420] [2024-10-24 07:35:05,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:35:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:35:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:35:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:35:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:35:05,234 INFO L87 Difference]: Start difference. First operand 218 states and 303 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 07:35:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:35:06,220 INFO L93 Difference]: Finished difference Result 382 states and 521 transitions. [2024-10-24 07:35:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:35:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 193 [2024-10-24 07:35:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:35:06,241 INFO L225 Difference]: With dead ends: 382 [2024-10-24 07:35:06,241 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 07:35:06,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 378 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-10-24 07:35:06,242 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 103 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 07:35:06,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 167 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 07:35:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 07:35:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2024-10-24 07:35:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 131 states have (on average 1.1221374045801527) internal successors, (147), 132 states have internal predecessors, (147), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:35:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 307 transitions. [2024-10-24 07:35:06,264 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 307 transitions. Word has length 193 [2024-10-24 07:35:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:35:06,264 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 307 transitions. [2024-10-24 07:35:06,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 07:35:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 307 transitions. [2024-10-24 07:35:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 07:35:06,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:35:06,266 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:35:06,280 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 (10)] Ended with exit code 0 [2024-10-24 07:35:06,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-10-24 07:35:06,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:35:06,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:35:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash -946691845, now seen corresponding path program 1 times [2024-10-24 07:35:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:35:06,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220121307] [2024-10-24 07:35:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:35:06,468 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-10-24 07:35:06,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:35:06,469 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-24 07:35:06,469 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 (11)] Waiting until timeout for monitored process [2024-10-24 07:35:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:35:06,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 07:35:06,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:35:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1196 proven. 144 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-24 07:35:07,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:35:07,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:35:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220121307] [2024-10-24 07:35:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220121307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:35:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1462210336] [2024-10-24 07:35:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:35:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:35:07,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:35:07,420 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:35:07,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-24 07:35:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:35:07,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:35:07,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:35:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-10-24 07:35:08,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:35:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1462210336] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:35:08,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:35:08,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2024-10-24 07:35:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826458325] [2024-10-24 07:35:08,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:35:08,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 07:35:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:35:08,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 07:35:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-10-24 07:35:08,224 INFO L87 Difference]: Start difference. First operand 226 states and 307 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-10-24 07:35:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:35:12,025 INFO L93 Difference]: Finished difference Result 403 states and 529 transitions. [2024-10-24 07:35:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 07:35:12,025 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 193 [2024-10-24 07:35:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:35:12,027 INFO L225 Difference]: With dead ends: 403 [2024-10-24 07:35:12,027 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 07:35:12,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2024-10-24 07:35:12,029 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 133 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:35:12,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 357 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 07:35:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 07:35:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 232. [2024-10-24 07:35:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 132 states have (on average 1.0606060606060606) internal successors, (140), 133 states have internal predecessors, (140), 80 states have call successors, (80), 19 states have call predecessors, (80), 19 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:35:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 300 transitions. [2024-10-24 07:35:12,052 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 300 transitions. Word has length 193 [2024-10-24 07:35:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:35:12,053 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 300 transitions. [2024-10-24 07:35:12,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-10-24 07:35:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 300 transitions. [2024-10-24 07:35:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 07:35:12,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:35:12,055 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:35:12,065 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 07:35:12,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-10-24 07:35:12,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 07:35:12,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:35:12,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:35:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -944844803, now seen corresponding path program 1 times [2024-10-24 07:35:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:35:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211235086] [2024-10-24 07:35:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:35:12,457 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-10-24 07:35:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:35:12,458 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-24 07:35:12,458 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 (13)] Waiting until timeout for monitored process [2024-10-24 07:35:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:35:12,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-24 07:35:12,712 INFO L278 TraceCheckSpWp]: Computing forward predicates...