./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.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 e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:00:24,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:00:24,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:00:24,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:00:24,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:00:24,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:00:24,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:00:24,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:00:24,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:00:24,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:00:24,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:00:24,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:00:24,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:00:24,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:00:24,216 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:00:24,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:00:24,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:00:24,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:00:24,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:00:24,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:00:24,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:00:24,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:00:24,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:00:24,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:00:24,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:00:24,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:00:24,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:00:24,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:00:24,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:00:24,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:00:24,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:00:24,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:00:24,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:24,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:00:24,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:00:24,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:00:24,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:00:24,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:00:24,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:00:24,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:00:24,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:00:24,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:00:24,225 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 -> e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d [2024-11-16 12:00:24,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:00:24,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:00:24,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:00:24,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:00:24,492 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:00:24,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-16 12:00:26,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:00:26,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:00:26,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-16 12:00:26,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c857224b7/2569defc0e834d20a3f65623dde4f65c/FLAGf4f61a39f [2024-11-16 12:00:26,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c857224b7/2569defc0e834d20a3f65623dde4f65c [2024-11-16 12:00:26,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:00:26,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:00:26,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:26,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:00:26,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:00:26,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39108a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26, skipping insertion in model container [2024-11-16 12:00:26,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:00:26,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-16 12:00:26,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:26,547 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:00:26,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-16 12:00:26,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:26,618 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:00:26,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26 WrapperNode [2024-11-16 12:00:26,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:26,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:26,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:00:26,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:00:26,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,697 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-16 12:00:26,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:26,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:00:26,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:00:26,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:00:26,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,745 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:00:26,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:00:26,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:00:26,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:00:26,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:00:26,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (1/1) ... [2024-11-16 12:00:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:26,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:00:26,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:00:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:00:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:00:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:00:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:00:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:00:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:00:26,942 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:00:26,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:00:27,302 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~bitwise17#1; [2024-11-16 12:00:27,335 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:00:27,335 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:00:27,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:00:27,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:00:27,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:27 BoogieIcfgContainer [2024-11-16 12:00:27,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:00:27,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:00:27,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:00:27,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:00:27,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:26" (1/3) ... [2024-11-16 12:00:27,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2b0451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:27, skipping insertion in model container [2024-11-16 12:00:27,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:26" (2/3) ... [2024-11-16 12:00:27,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2b0451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:27, skipping insertion in model container [2024-11-16 12:00:27,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:27" (3/3) ... [2024-11-16 12:00:27,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-13.i [2024-11-16 12:00:27,379 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:00:27,381 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:00:27,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:00:27,451 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;@6780b0ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:00:27,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:00:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:00:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:00:27,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:27,465 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:27,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:27,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash 398406715, now seen corresponding path program 1 times [2024-11-16 12:00:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562617081] [2024-11-16 12:00:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:00:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:00:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:00:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:00:27,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:27,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562617081] [2024-11-16 12:00:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562617081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:27,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:00:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414742371] [2024-11-16 12:00:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:27,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:00:28,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:00:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:00:28,033 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:00:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:28,074 INFO L93 Difference]: Finished difference Result 132 states and 221 transitions. [2024-11-16 12:00:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:00:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 134 [2024-11-16 12:00:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:28,084 INFO L225 Difference]: With dead ends: 132 [2024-11-16 12:00:28,084 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 12:00:28,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:00:28,090 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:28,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:00:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 12:00:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-16 12:00:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:00:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-11-16 12:00:28,128 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 134 [2024-11-16 12:00:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:28,128 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-11-16 12:00:28,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:00:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-11-16 12:00:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:00:28,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:28,132 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:28,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:00:28,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1569858776, now seen corresponding path program 1 times [2024-11-16 12:00:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152870267] [2024-11-16 12:00:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:00:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:00:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:00:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:00:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152870267] [2024-11-16 12:00:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152870267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:00:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433096798] [2024-11-16 12:00:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:28,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:00:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:00:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:00:28,470 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:28,531 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2024-11-16 12:00:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:00:28,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-16 12:00:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:28,535 INFO L225 Difference]: With dead ends: 161 [2024-11-16 12:00:28,535 INFO L226 Difference]: Without dead ends: 99 [2024-11-16 12:00:28,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:00:28,537 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 40 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:28,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 209 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:00:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-16 12:00:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-16 12:00:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:00:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-16 12:00:28,565 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 134 [2024-11-16 12:00:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:28,566 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-16 12:00:28,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-16 12:00:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:00:28,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:28,571 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:00:28,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1064300151, now seen corresponding path program 1 times [2024-11-16 12:00:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357136227] [2024-11-16 12:00:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:00:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:00:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:00:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:00:29,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357136227] [2024-11-16 12:00:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357136227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:00:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228006874] [2024-11-16 12:00:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:29,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:00:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:00:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:29,368 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:29,772 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2024-11-16 12:00:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:00:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-16 12:00:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:29,779 INFO L225 Difference]: With dead ends: 269 [2024-11-16 12:00:29,779 INFO L226 Difference]: Without dead ends: 177 [2024-11-16 12:00:29,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:00:29,781 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:29,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 287 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:00:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-16 12:00:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 136. [2024-11-16 12:00:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 87 states have internal predecessors, (106), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 12:00:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions. [2024-11-16 12:00:29,824 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 134 [2024-11-16 12:00:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:29,828 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 198 transitions. [2024-11-16 12:00:29,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions. [2024-11-16 12:00:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 12:00:29,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:29,830 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:00:29,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 464849115, now seen corresponding path program 1 times [2024-11-16 12:00:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216314230] [2024-11-16 12:00:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:00:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:00:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:00:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:00:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:30,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216314230] [2024-11-16 12:00:30,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216314230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601591471] [2024-11-16 12:00:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:30,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:30,134 INFO L87 Difference]: Start difference. First operand 136 states and 198 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:30,310 INFO L93 Difference]: Finished difference Result 268 states and 387 transitions. [2024-11-16 12:00:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:30,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-11-16 12:00:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:30,313 INFO L225 Difference]: With dead ends: 268 [2024-11-16 12:00:30,313 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 12:00:30,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:30,315 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 116 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:30,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 112 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 12:00:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2024-11-16 12:00:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 12:00:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-16 12:00:30,351 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 135 [2024-11-16 12:00:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:30,353 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-16 12:00:30,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-16 12:00:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 12:00:30,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:30,356 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:30,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:00:30,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:30,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 171446108, now seen corresponding path program 1 times [2024-11-16 12:00:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:30,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241540087] [2024-11-16 12:00:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:00:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627499940] [2024-11-16 12:00:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:30,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:30,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:30,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:00:30,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:00:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:00:30,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:00:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:00:30,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:00:30,719 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:00:30,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:00:30,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:00:30,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:30,926 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:00:31,029 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:00:31,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:00:31 BoogieIcfgContainer [2024-11-16 12:00:31,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:00:31,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:00:31,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:00:31,033 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:00:31,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:27" (3/4) ... [2024-11-16 12:00:31,036 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:00:31,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:00:31,038 INFO L158 Benchmark]: Toolchain (without parser) took 4764.77ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 147.1MB in the beginning and 121.7MB in the end (delta: 25.4MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-16 12:00:31,041 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:31,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.18ms. Allocated memory is still 178.3MB. Free memory was 146.9MB in the beginning and 136.6MB in the end (delta: 10.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-16 12:00:31,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.37ms. Allocated memory is still 178.3MB. Free memory was 136.6MB in the beginning and 132.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:00:31,042 INFO L158 Benchmark]: Boogie Preprocessor took 72.99ms. Allocated memory is still 178.3MB. Free memory was 132.9MB in the beginning and 128.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 12:00:31,042 INFO L158 Benchmark]: IcfgBuilder took 581.71ms. Allocated memory is still 178.3MB. Free memory was 127.4MB in the beginning and 106.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 12:00:31,043 INFO L158 Benchmark]: TraceAbstraction took 3675.48ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 105.7MB in the beginning and 121.7MB in the end (delta: -16.0MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-16 12:00:31,043 INFO L158 Benchmark]: Witness Printer took 5.20ms. Allocated memory is still 213.9MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:31,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.18ms. Allocated memory is still 178.3MB. Free memory was 146.9MB in the beginning and 136.6MB in the end (delta: 10.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.37ms. Allocated memory is still 178.3MB. Free memory was 136.6MB in the beginning and 132.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.99ms. Allocated memory is still 178.3MB. Free memory was 132.9MB in the beginning and 128.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 581.71ms. Allocated memory is still 178.3MB. Free memory was 127.4MB in the beginning and 106.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3675.48ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 105.7MB in the beginning and 121.7MB in the end (delta: -16.0MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 5.20ms. Allocated memory is still 213.9MB. Free memory is still 121.7MB. 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 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] signed short int last_1_var_1_21 = -64; [L43] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_21 = var_1_21 [L120] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L88] var_1_5 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_8=1, var_1_9=0] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1] [L95] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1] [L96] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L97] var_1_10 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L100] var_1_11 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L109] var_1_17 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L111] var_1_18 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L113] var_1_19 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L115] var_1_20 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L131] RET updateVariables() [L132] CALL step() [L47] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L47] COND TRUE (~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4) [L48] COND TRUE var_1_5 || var_1_6 [L49] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L56] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L59] COND FALSE !(var_1_4 > var_1_1) [L62] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L64] COND TRUE ((- var_1_11) < 8) || var_1_9 [L65] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L67] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L68] COND TRUE var_1_18 <= var_1_20 [L69] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L75] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L80] COND TRUE var_1_10 > var_1_21 [L81] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L123-L124] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=63, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 379 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 1580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:00:31,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.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 e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:00:33,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:00:33,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:00:33,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:00:33,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:00:33,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:00:33,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:00:33,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:00:33,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:00:33,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:00:33,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:00:33,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:00:33,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:00:33,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:00:33,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:00:33,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:00:33,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:00:33,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:00:33,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:00:33,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:00:33,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:00:33,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:00:33,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:00:33,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:00:33,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:00:33,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:00:33,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:00:33,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:00:33,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:00:33,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:00:33,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:00:33,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:00:33,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:00:33,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:00:33,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:33,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:00:33,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:00:33,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:00:33,397 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:00:33,397 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:00:33,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:00:33,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:00:33,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:00:33,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:00:33,398 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 -> e3378da90f8a3bcfd5e2213b6859d093fcffcd5d6c413620435d8b005a69738d [2024-11-16 12:00:33,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:00:33,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:00:33,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:00:33,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:00:33,754 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:00:33,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-16 12:00:35,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:00:35,574 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:00:35,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i [2024-11-16 12:00:35,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f330d4195/e215177f25e54a1698e5722761bd9a63/FLAG44f8a34f9 [2024-11-16 12:00:35,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f330d4195/e215177f25e54a1698e5722761bd9a63 [2024-11-16 12:00:35,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:00:35,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:00:35,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:35,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:00:35,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:00:35,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584b7942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35, skipping insertion in model container [2024-11-16 12:00:35,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:00:35,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-16 12:00:35,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:35,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:00:35,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-13.i[919,932] [2024-11-16 12:00:36,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:36,021 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:00:36,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36 WrapperNode [2024-11-16 12:00:36,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:36,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:36,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:00:36,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:00:36,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,085 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-16 12:00:36,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:36,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:00:36,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:00:36,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:00:36,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:00:36,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:00:36,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:00:36,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:00:36,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:00:36,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (1/1) ... [2024-11-16 12:00:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:36,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:36,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:00:36,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:00:36,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:00:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:00:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:00:36,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:00:36,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:00:36,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:00:36,335 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:00:36,339 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:00:40,084 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:00:40,084 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:00:40,097 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:00:40,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:00:40,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:40 BoogieIcfgContainer [2024-11-16 12:00:40,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:00:40,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:00:40,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:00:40,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:00:40,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:35" (1/3) ... [2024-11-16 12:00:40,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b1ecb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:40, skipping insertion in model container [2024-11-16 12:00:40,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:36" (2/3) ... [2024-11-16 12:00:40,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b1ecb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:40, skipping insertion in model container [2024-11-16 12:00:40,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:40" (3/3) ... [2024-11-16 12:00:40,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-13.i [2024-11-16 12:00:40,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:00:40,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:00:40,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:00:40,198 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;@5cf7589b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:00:40,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:00:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:00:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 12:00:40,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:40,220 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:40,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:40,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -619222541, now seen corresponding path program 1 times [2024-11-16 12:00:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862213667] [2024-11-16 12:00:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:40,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:40,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:40,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:00:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:40,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:00:40,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-16 12:00:40,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:40,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862213667] [2024-11-16 12:00:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862213667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:00:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145755879] [2024-11-16 12:00:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:40,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:00:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:00:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:00:40,761 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:00:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:40,793 INFO L93 Difference]: Finished difference Result 122 states and 207 transitions. [2024-11-16 12:00:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:00:40,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2024-11-16 12:00:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:40,803 INFO L225 Difference]: With dead ends: 122 [2024-11-16 12:00:40,803 INFO L226 Difference]: Without dead ends: 60 [2024-11-16 12:00:40,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:00:40,811 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:40,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:00:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-16 12:00:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-16 12:00:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:00:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2024-11-16 12:00:40,861 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 131 [2024-11-16 12:00:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2024-11-16 12:00:40,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:00:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2024-11-16 12:00:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 12:00:40,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:40,864 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:40,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:00:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:41,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:41,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash 731837815, now seen corresponding path program 1 times [2024-11-16 12:00:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:41,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402750513] [2024-11-16 12:00:41,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:41,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:41,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:41,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:00:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:41,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 12:00:41,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:00:42,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:42,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402750513] [2024-11-16 12:00:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402750513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:42,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:00:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854216055] [2024-11-16 12:00:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:42,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:42,904 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:44,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:00:47,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:00:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:47,538 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2024-11-16 12:00:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-16 12:00:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:47,570 INFO L225 Difference]: With dead ends: 176 [2024-11-16 12:00:47,570 INFO L226 Difference]: Without dead ends: 119 [2024-11-16 12:00:47,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:47,572 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:47,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 242 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-16 12:00:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-16 12:00:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2024-11-16 12:00:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 12:00:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-16 12:00:47,631 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 131 [2024-11-16 12:00:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:47,632 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-16 12:00:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-16 12:00:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:00:47,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:47,641 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:47,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 12:00:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:47,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash -429867688, now seen corresponding path program 1 times [2024-11-16 12:00:47,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:47,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091635733] [2024-11-16 12:00:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:47,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:47,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:47,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:47,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 12:00:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:48,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:00:48,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:00:48,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:48,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091635733] [2024-11-16 12:00:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091635733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:48,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:00:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107934444] [2024-11-16 12:00:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:48,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:00:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:48,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:00:48,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:00:48,176 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:50,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:00:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:50,279 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2024-11-16 12:00:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:00:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-16 12:00:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:50,284 INFO L225 Difference]: With dead ends: 188 [2024-11-16 12:00:50,284 INFO L226 Difference]: Without dead ends: 131 [2024-11-16 12:00:50,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:00:50,286 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:50,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 12:00:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-16 12:00:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2024-11-16 12:00:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 12:00:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-16 12:00:50,309 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 132 [2024-11-16 12:00:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:50,310 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-16 12:00:50,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:00:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-16 12:00:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:00:50,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:50,313 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:00:50,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 12:00:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:50,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -300784969, now seen corresponding path program 1 times [2024-11-16 12:00:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428495826] [2024-11-16 12:00:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:50,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:50,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 12:00:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:50,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 12:00:50,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:01:03,579 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:11,663 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:19,738 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:27,303 WARN L286 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:33,338 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:41,072 WARN L286 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:46,872 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:01:54,003 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 12:02:00,764 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)