./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a8fb5b6f229e5a4fd597c3d3ce627886ac65e8da3c998565f3e47e3b850a3640 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:21:41,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:21:41,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:21:41,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:21:41,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:21:41,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:21:41,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:21:41,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:21:41,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:21:41,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:21:41,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:21:41,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:21:41,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:21:41,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:21:41,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:21:41,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:21:41,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:21:41,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:21:41,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:21:41,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:21:41,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:21:41,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:21:41,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:21:41,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:21:41,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:21:41,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:21:41,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:21:41,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:21:41,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:21:41,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:21:41,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:21:41,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:21:41,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:21:41,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:21:41,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:21:41,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:21:41,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:21:41,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:21:41,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:21:41,710 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8fb5b6f229e5a4fd597c3d3ce627886ac65e8da3c998565f3e47e3b850a3640 [2024-11-10 01:21:41,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:21:41,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:21:41,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:21:41,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:21:41,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:21:41,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c [2024-11-10 01:21:43,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:21:43,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:21:43,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c [2024-11-10 01:21:43,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e227740f/8b91960c2fc2439b8a6cc7fab3c7dd83/FLAGdb0e28c87 [2024-11-10 01:21:43,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e227740f/8b91960c2fc2439b8a6cc7fab3c7dd83 [2024-11-10 01:21:43,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:21:43,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:21:43,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:21:43,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:21:43,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:21:43,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:21:43" (1/1) ... [2024-11-10 01:21:43,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0991fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:43, skipping insertion in model container [2024-11-10 01:21:43,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:21:43" (1/1) ... [2024-11-10 01:21:43,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:21:43,594 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/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c[1173,1186] [2024-11-10 01:21:43,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:21:43,876 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:21:43,885 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/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c[1173,1186] [2024-11-10 01:21:44,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:21:44,070 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:21:44,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44 WrapperNode [2024-11-10 01:21:44,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:21:44,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:21:44,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:21:44,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:21:44,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:44,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:44,628 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5233 [2024-11-10 01:21:44,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:21:44,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:21:44,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:21:44,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:21:44,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:44,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:44,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:44,893 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:21:44,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:44,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:45,110 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:45,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:45,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:45,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:45,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:21:45,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:21:45,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:21:45,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:21:45,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (1/1) ... [2024-11-10 01:21:45,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:21:45,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:21:45,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:21:45,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:21:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:21:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:21:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:21:45,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:21:45,556 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:21:45,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:21:49,658 INFO L? ?]: Removed 2933 outVars from TransFormulas that were not future-live. [2024-11-10 01:21:49,659 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:21:49,828 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:21:49,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:21:49,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:21:49 BoogieIcfgContainer [2024-11-10 01:21:49,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:21:49,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:21:49,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:21:49,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:21:49,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:21:43" (1/3) ... [2024-11-10 01:21:49,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e763c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:21:49, skipping insertion in model container [2024-11-10 01:21:49,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:21:44" (2/3) ... [2024-11-10 01:21:49,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e763c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:21:49, skipping insertion in model container [2024-11-10 01:21:49,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:21:49" (3/3) ... [2024-11-10 01:21:49,836 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.3.prop1-func-interl.c [2024-11-10 01:21:49,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:21:49,851 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:21:49,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:21:49,919 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;@7e56cb74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:21:49,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:21:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 1805 states, 1803 states have (on average 1.4986134220743206) internal successors, (2702), 1804 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:21:49,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:49,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:49,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1042092599, now seen corresponding path program 1 times [2024-11-10 01:21:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590500416] [2024-11-10 01:21:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:21:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590500416] [2024-11-10 01:21:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590500416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:50,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:21:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553822657] [2024-11-10 01:21:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:50,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:21:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:21:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:50,719 INFO L87 Difference]: Start difference. First operand has 1805 states, 1803 states have (on average 1.4986134220743206) internal successors, (2702), 1804 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:51,524 INFO L93 Difference]: Finished difference Result 3493 states and 5233 transitions. [2024-11-10 01:21:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:21:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:21:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:51,549 INFO L225 Difference]: With dead ends: 3493 [2024-11-10 01:21:51,549 INFO L226 Difference]: Without dead ends: 1802 [2024-11-10 01:21:51,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:51,558 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 0 mSDsluCounter, 4487 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6733 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:51,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6733 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:21:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-10 01:21:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-10 01:21:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 1.4980566352026652) internal successors, (2698), 1801 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2698 transitions. [2024-11-10 01:21:51,647 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2698 transitions. Word has length 108 [2024-11-10 01:21:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:51,648 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2698 transitions. [2024-11-10 01:21:51,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2698 transitions. [2024-11-10 01:21:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 01:21:51,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:51,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:51,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:21:51,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1909811643, now seen corresponding path program 1 times [2024-11-10 01:21:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:51,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609180089] [2024-11-10 01:21:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:21:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609180089] [2024-11-10 01:21:51,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609180089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:51,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:21:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930035231] [2024-11-10 01:21:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:51,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:21:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:21:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:51,867 INFO L87 Difference]: Start difference. First operand 1802 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:52,606 INFO L93 Difference]: Finished difference Result 3492 states and 5229 transitions. [2024-11-10 01:21:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:21:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-10 01:21:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:52,614 INFO L225 Difference]: With dead ends: 3492 [2024-11-10 01:21:52,614 INFO L226 Difference]: Without dead ends: 1804 [2024-11-10 01:21:52,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:52,618 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 0 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6730 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:52,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6730 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:21:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-10 01:21:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2024-11-10 01:21:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.497504159733777) internal successors, (2700), 1803 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2700 transitions. [2024-11-10 01:21:52,645 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2700 transitions. Word has length 109 [2024-11-10 01:21:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:52,646 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2700 transitions. [2024-11-10 01:21:52,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2700 transitions. [2024-11-10 01:21:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 01:21:52,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:52,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:21:52,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 672627548, now seen corresponding path program 1 times [2024-11-10 01:21:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520172382] [2024-11-10 01:21:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:21:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520172382] [2024-11-10 01:21:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520172382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:21:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827125660] [2024-11-10 01:21:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:52,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:21:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:21:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:52,833 INFO L87 Difference]: Start difference. First operand 1804 states and 2700 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:53,553 INFO L93 Difference]: Finished difference Result 3496 states and 5233 transitions. [2024-11-10 01:21:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:21:53,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-10 01:21:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:53,557 INFO L225 Difference]: With dead ends: 3496 [2024-11-10 01:21:53,557 INFO L226 Difference]: Without dead ends: 1806 [2024-11-10 01:21:53,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:53,559 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 0 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6725 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:53,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6725 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:21:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-10 01:21:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2024-11-10 01:21:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 1.4969529085872577) internal successors, (2702), 1805 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2702 transitions. [2024-11-10 01:21:53,602 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2702 transitions. Word has length 110 [2024-11-10 01:21:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:53,603 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2702 transitions. [2024-11-10 01:21:53,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2702 transitions. [2024-11-10 01:21:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 01:21:53,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:53,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:53,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:21:53,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2081282976, now seen corresponding path program 1 times [2024-11-10 01:21:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352400363] [2024-11-10 01:21:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:21:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352400363] [2024-11-10 01:21:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352400363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:21:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577918256] [2024-11-10 01:21:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:53,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:21:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:21:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:53,788 INFO L87 Difference]: Start difference. First operand 1806 states and 2702 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:54,453 INFO L93 Difference]: Finished difference Result 3506 states and 5245 transitions. [2024-11-10 01:21:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:21:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-10 01:21:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:54,462 INFO L225 Difference]: With dead ends: 3506 [2024-11-10 01:21:54,462 INFO L226 Difference]: Without dead ends: 1814 [2024-11-10 01:21:54,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:54,467 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 3 mSDsluCounter, 4479 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6725 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:54,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6725 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:21:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2024-11-10 01:21:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1810. [2024-11-10 01:21:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.4969596462133776) internal successors, (2708), 1809 states have internal predecessors, (2708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2708 transitions. [2024-11-10 01:21:54,494 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2708 transitions. Word has length 111 [2024-11-10 01:21:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:54,495 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2708 transitions. [2024-11-10 01:21:54,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2708 transitions. [2024-11-10 01:21:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 01:21:54,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:54,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:21:54,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:54,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash 314149761, now seen corresponding path program 1 times [2024-11-10 01:21:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340794286] [2024-11-10 01:21:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:21:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340794286] [2024-11-10 01:21:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340794286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:54,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:21:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513971417] [2024-11-10 01:21:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:54,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:21:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:21:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:21:54,747 INFO L87 Difference]: Start difference. First operand 1810 states and 2708 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:56,832 INFO L93 Difference]: Finished difference Result 5186 states and 7760 transitions. [2024-11-10 01:21:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:21:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-10 01:21:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:56,841 INFO L225 Difference]: With dead ends: 5186 [2024-11-10 01:21:56,841 INFO L226 Difference]: Without dead ends: 3490 [2024-11-10 01:21:56,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:21:56,843 INFO L432 NwaCegarLoop]: 1759 mSDtfsCounter, 2580 mSDsluCounter, 5162 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2580 SdHoareTripleChecker+Valid, 6921 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:56,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2580 Valid, 6921 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 01:21:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2024-11-10 01:21:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 1889. [2024-11-10 01:21:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.496292372881356) internal successors, (2825), 1888 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2825 transitions. [2024-11-10 01:21:56,877 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2825 transitions. Word has length 112 [2024-11-10 01:21:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:56,877 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2825 transitions. [2024-11-10 01:21:56,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2825 transitions. [2024-11-10 01:21:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 01:21:56,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:56,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:56,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:21:56,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1431049887, now seen corresponding path program 1 times [2024-11-10 01:21:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:56,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518442708] [2024-11-10 01:21:56,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:21:57,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518442708] [2024-11-10 01:21:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518442708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:57,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:21:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001047054] [2024-11-10 01:21:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:21:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:57,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:21:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:21:57,132 INFO L87 Difference]: Start difference. First operand 1889 states and 2825 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:58,478 INFO L93 Difference]: Finished difference Result 3585 states and 5363 transitions. [2024-11-10 01:21:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:21:58,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-10 01:21:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:58,483 INFO L225 Difference]: With dead ends: 3585 [2024-11-10 01:21:58,484 INFO L226 Difference]: Without dead ends: 1889 [2024-11-10 01:21:58,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:21:58,490 INFO L432 NwaCegarLoop]: 1751 mSDtfsCounter, 2595 mSDsluCounter, 3491 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2595 SdHoareTripleChecker+Valid, 5242 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:58,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2595 Valid, 5242 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 01:21:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-11-10 01:21:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2024-11-10 01:21:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.4941737288135593) internal successors, (2821), 1888 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2821 transitions. [2024-11-10 01:21:58,520 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2821 transitions. Word has length 113 [2024-11-10 01:21:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:58,520 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2821 transitions. [2024-11-10 01:21:58,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:21:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2821 transitions. [2024-11-10 01:21:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 01:21:58,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:58,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:58,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:21:58,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:58,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1197250675, now seen corresponding path program 1 times [2024-11-10 01:21:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:58,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266724234] [2024-11-10 01:21:58,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:21:58,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 01:21:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:21:58,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 01:21:58,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 01:21:58,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:21:58,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:21:58,678 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:58,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:21:58,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:21:58 BoogieIcfgContainer [2024-11-10 01:21:58,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:21:58,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:21:58,765 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:21:58,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:21:58,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:21:49" (3/4) ... [2024-11-10 01:21:58,768 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 01:21:58,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:21:58,769 INFO L158 Benchmark]: Toolchain (without parser) took 15386.34ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 111.7MB in the beginning and 665.8MB in the end (delta: -554.2MB). Peak memory consumption was 487.8MB. Max. memory is 16.1GB. [2024-11-10 01:21:58,769 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:21:58,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.84ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 111.7MB in the beginning and 197.4MB in the end (delta: -85.7MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2024-11-10 01:21:58,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 557.21ms. Allocated memory is still 253.8MB. Free memory was 197.4MB in the beginning and 123.0MB in the end (delta: 74.4MB). Peak memory consumption was 162.8MB. Max. memory is 16.1GB. [2024-11-10 01:21:58,770 INFO L158 Benchmark]: Boogie Preprocessor took 596.13ms. Allocated memory was 253.8MB in the beginning and 507.5MB in the end (delta: 253.8MB). Free memory was 123.0MB in the beginning and 356.5MB in the end (delta: -233.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-10 01:21:58,770 INFO L158 Benchmark]: IcfgBuilder took 4603.34ms. Allocated memory was 507.5MB in the beginning and 820.0MB in the end (delta: 312.5MB). Free memory was 356.5MB in the beginning and 385.9MB in the end (delta: -29.4MB). Peak memory consumption was 324.0MB. Max. memory is 16.1GB. [2024-11-10 01:21:58,771 INFO L158 Benchmark]: TraceAbstraction took 8934.03ms. Allocated memory was 820.0MB in the beginning and 1.2GB in the end (delta: 390.1MB). Free memory was 385.9MB in the beginning and 666.9MB in the end (delta: -281.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-11-10 01:21:58,771 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 1.2GB. Free memory is still 665.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:21:58,772 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.10ms. Allocated memory is still 169.9MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.84ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 111.7MB in the beginning and 197.4MB in the end (delta: -85.7MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 557.21ms. Allocated memory is still 253.8MB. Free memory was 197.4MB in the beginning and 123.0MB in the end (delta: 74.4MB). Peak memory consumption was 162.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 596.13ms. Allocated memory was 253.8MB in the beginning and 507.5MB in the end (delta: 253.8MB). Free memory was 123.0MB in the beginning and 356.5MB in the end (delta: -233.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * IcfgBuilder took 4603.34ms. Allocated memory was 507.5MB in the beginning and 820.0MB in the end (delta: 312.5MB). Free memory was 356.5MB in the beginning and 385.9MB in the end (delta: -29.4MB). Peak memory consumption was 324.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8934.03ms. Allocated memory was 820.0MB in the beginning and 1.2GB in the end (delta: 390.1MB). Free memory was 385.9MB in the beginning and 666.9MB in the end (delta: -281.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 1.2GB. Free memory is still 665.8MB. 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: 21]: 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 bitwiseAnd at line 231. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_4 var_63 = 1; [L41] const SORT_4 var_64 = 0; [L42] const SORT_2 var_74 = 0; [L43] const SORT_2 var_76 = 1; [L44] const SORT_3 var_91 = 0; [L45] const SORT_4 var_227 = 3; [L46] const SORT_2 var_239 = 3; [L47] const SORT_4 var_241 = 4; [L48] const SORT_4 var_343 = 2; [L50] SORT_1 input_73; [L51] SORT_1 input_75; [L52] SORT_1 input_80; [L53] SORT_1 input_81; [L54] SORT_1 input_85; [L55] SORT_1 input_86; [L56] SORT_1 input_90; [L57] SORT_1 input_98; [L58] SORT_1 input_105; [L59] SORT_1 input_112; [L60] SORT_1 input_116; [L61] SORT_1 input_117; [L62] SORT_1 input_131; [L63] SORT_1 input_135; [L64] SORT_1 input_136; [L65] SORT_1 input_150; [L66] SORT_1 input_154; [L67] SORT_1 input_155; [L68] SORT_1 input_176; [L69] SORT_1 input_179; [L70] SORT_1 input_195; [L71] SORT_1 input_198; [L72] SORT_1 input_214; [L73] SORT_1 input_217; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L75] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L76] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L77] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L78] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L79] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L80] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L81] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L82] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L83] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L84] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L85] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L86] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L87] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L88] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L89] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L90] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L91] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L92] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L93] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L94] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L95] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L96] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L97] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L98] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L99] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L100] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L101] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_227=3, var_239=3, var_241=4, var_30=0, var_343=2, var_5=0, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L102] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] SORT_2 init_7_arg_1 = var_5; [L105] state_6 = init_7_arg_1 [L106] SORT_2 init_9_arg_1 = var_5; [L107] state_8 = init_9_arg_1 [L108] SORT_2 init_11_arg_1 = var_5; [L109] state_10 = init_11_arg_1 [L110] SORT_2 init_13_arg_1 = var_5; [L111] state_12 = init_13_arg_1 [L112] SORT_2 init_15_arg_1 = var_5; [L113] state_14 = init_15_arg_1 [L114] SORT_2 init_17_arg_1 = var_5; [L115] state_16 = init_17_arg_1 [L116] SORT_2 init_19_arg_1 = var_5; [L117] state_18 = init_19_arg_1 [L118] SORT_2 init_21_arg_1 = var_5; [L119] state_20 = init_21_arg_1 [L120] SORT_2 init_23_arg_1 = var_5; [L121] state_22 = init_23_arg_1 [L122] SORT_2 init_25_arg_1 = var_5; [L123] state_24 = init_25_arg_1 [L124] SORT_2 init_27_arg_1 = var_5; [L125] state_26 = init_27_arg_1 [L126] SORT_2 init_29_arg_1 = var_5; [L127] state_28 = init_29_arg_1 [L128] SORT_1 init_32_arg_1 = var_30; [L129] state_31 = init_32_arg_1 [L130] SORT_1 init_34_arg_1 = var_30; [L131] state_33 = init_34_arg_1 [L132] SORT_1 init_36_arg_1 = var_30; [L133] state_35 = init_36_arg_1 [L134] SORT_1 init_38_arg_1 = var_30; [L135] state_37 = init_38_arg_1 [L136] SORT_1 init_40_arg_1 = var_30; [L137] state_39 = init_40_arg_1 [L138] SORT_1 init_42_arg_1 = var_30; [L139] state_41 = init_42_arg_1 [L140] SORT_1 init_44_arg_1 = var_30; [L141] state_43 = init_44_arg_1 [L142] SORT_1 init_46_arg_1 = var_30; [L143] state_45 = init_46_arg_1 [L144] SORT_1 init_48_arg_1 = var_30; [L145] state_47 = init_48_arg_1 [L146] SORT_1 init_50_arg_1 = var_30; [L147] state_49 = init_50_arg_1 [L148] SORT_1 init_52_arg_1 = var_30; [L149] state_51 = init_52_arg_1 [L150] SORT_1 init_54_arg_1 = var_30; [L151] state_53 = init_54_arg_1 [L152] SORT_1 init_56_arg_1 = var_30; [L153] state_55 = init_56_arg_1 [L154] SORT_1 init_58_arg_1 = var_30; [L155] state_57 = init_58_arg_1 [L156] SORT_1 init_60_arg_1 = var_30; [L157] state_59 = init_60_arg_1 [L158] SORT_1 init_62_arg_1 = var_30; [L159] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L162] input_73 = __VERIFIER_nondet_uchar() [L163] EXPR input_73 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L163] input_73 = input_73 & mask_SORT_1 [L164] input_75 = __VERIFIER_nondet_uchar() [L165] EXPR input_75 & mask_SORT_1 VAL [input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L165] input_75 = input_75 & mask_SORT_1 [L166] input_80 = __VERIFIER_nondet_uchar() [L167] EXPR input_80 & mask_SORT_1 VAL [input_73=0, input_75=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L167] input_80 = input_80 & mask_SORT_1 [L168] input_81 = __VERIFIER_nondet_uchar() [L169] EXPR input_81 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L169] input_81 = input_81 & mask_SORT_1 [L170] input_85 = __VERIFIER_nondet_uchar() [L171] EXPR input_85 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L171] input_85 = input_85 & mask_SORT_1 [L172] input_86 = __VERIFIER_nondet_uchar() [L173] EXPR input_86 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L173] input_86 = input_86 & mask_SORT_1 [L174] input_90 = __VERIFIER_nondet_uchar() [L175] EXPR input_90 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L175] input_90 = input_90 & mask_SORT_1 [L176] input_98 = __VERIFIER_nondet_uchar() [L177] EXPR input_98 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L177] input_98 = input_98 & mask_SORT_1 [L178] input_105 = __VERIFIER_nondet_uchar() [L179] EXPR input_105 & mask_SORT_1 VAL [input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L179] input_105 = input_105 & mask_SORT_1 [L180] input_112 = __VERIFIER_nondet_uchar() [L181] EXPR input_112 & mask_SORT_1 VAL [input_105=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L181] input_112 = input_112 & mask_SORT_1 [L182] input_116 = __VERIFIER_nondet_uchar() [L183] EXPR input_116 & mask_SORT_1 VAL [input_105=0, input_112=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L183] input_116 = input_116 & mask_SORT_1 [L184] input_117 = __VERIFIER_nondet_uchar() [L185] EXPR input_117 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L185] input_117 = input_117 & mask_SORT_1 [L186] input_131 = __VERIFIER_nondet_uchar() [L187] EXPR input_131 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L187] input_131 = input_131 & mask_SORT_1 [L188] input_135 = __VERIFIER_nondet_uchar() [L189] EXPR input_135 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L189] input_135 = input_135 & mask_SORT_1 [L190] input_136 = __VERIFIER_nondet_uchar() [L191] EXPR input_136 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L191] input_136 = input_136 & mask_SORT_1 [L192] input_150 = __VERIFIER_nondet_uchar() [L193] EXPR input_150 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L193] input_150 = input_150 & mask_SORT_1 [L194] input_154 = __VERIFIER_nondet_uchar() [L195] EXPR input_154 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L195] input_154 = input_154 & mask_SORT_1 [L196] input_155 = __VERIFIER_nondet_uchar() [L197] EXPR input_155 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L197] input_155 = input_155 & mask_SORT_1 [L198] input_176 = __VERIFIER_nondet_uchar() [L199] input_179 = __VERIFIER_nondet_uchar() [L200] input_195 = __VERIFIER_nondet_uchar() [L201] input_198 = __VERIFIER_nondet_uchar() [L202] input_214 = __VERIFIER_nondet_uchar() [L203] input_217 = __VERIFIER_nondet_uchar() [L206] SORT_1 var_65_arg_0 = state_39; [L207] SORT_4 var_65_arg_1 = var_63; [L208] SORT_4 var_65_arg_2 = var_64; [L209] SORT_4 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L210] SORT_1 var_66_arg_0 = state_49; [L211] SORT_4 var_66_arg_1 = var_63; [L212] SORT_4 var_66_arg_2 = var_64; [L213] SORT_4 var_66 = var_66_arg_0 ? var_66_arg_1 : var_66_arg_2; [L214] SORT_4 var_67_arg_0 = var_65; [L215] SORT_4 var_67_arg_1 = var_66; [L216] SORT_4 var_67 = var_67_arg_0 + var_67_arg_1; [L217] SORT_1 var_68_arg_0 = state_59; [L218] SORT_4 var_68_arg_1 = var_63; [L219] SORT_4 var_68_arg_2 = var_64; [L220] SORT_4 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L221] SORT_4 var_69_arg_0 = var_67; [L222] SORT_4 var_69_arg_1 = var_68; [L223] SORT_4 var_69 = var_69_arg_0 + var_69_arg_1; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_69=0, var_74=0, var_76=1, var_91=0] [L224] EXPR var_69 & mask_SORT_4 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L224] var_69 = var_69 & mask_SORT_4 [L225] SORT_4 var_70_arg_0 = var_69; [L226] SORT_4 var_70_arg_1 = var_63; [L227] SORT_1 var_70 = var_70_arg_0 <= var_70_arg_1; [L228] SORT_1 var_71_arg_0 = ~state_61; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_70=1, var_71_arg_0=-1, var_74=0, var_76=1, var_91=0] [L229] EXPR var_71_arg_0 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_70=1, var_74=0, var_76=1, var_91=0] [L229] var_71_arg_0 = var_71_arg_0 & mask_SORT_1 [L230] SORT_1 var_71_arg_1 = ~var_70; VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_71_arg_1=-2, var_74=0, var_76=1, var_91=0] [L231] EXPR var_71_arg_1 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_71_arg_0=1, var_74=0, var_76=1, var_91=0] [L231] var_71_arg_1 = var_71_arg_1 & mask_SORT_1 [L232] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L232] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L233] EXPR var_71 & mask_SORT_1 VAL [input_105=0, input_112=0, input_116=0, input_117=0, input_131=0, input_135=0, input_136=0, input_150=0, input_154=0, input_155=0, input_73=0, input_75=0, input_80=0, input_81=0, input_85=0, input_86=0, input_90=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_6=0, state_8=0, var_227=3, var_239=3, var_241=4, var_343=2, var_63=1, var_64=0, var_74=0, var_76=1, var_91=0] [L233] var_71 = var_71 & mask_SORT_1 [L234] SORT_1 bad_72_arg_0 = var_71; [L235] CALL __VERIFIER_assert(!(bad_72_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1805 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5178 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5178 mSDsluCounter, 39076 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26582 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11959 IncrementalHoareTripleChecker+Invalid, 11961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 12494 mSDtfsCounter, 11959 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1889occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1605 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 01:21:58,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a8fb5b6f229e5a4fd597c3d3ce627886ac65e8da3c998565f3e47e3b850a3640 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:22:00,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:22:00,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 01:22:00,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:22:00,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:22:00,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:22:00,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:22:00,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:22:00,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:22:00,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:22:00,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:22:00,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:22:00,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:22:00,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:22:00,785 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:22:00,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:22:00,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:22:00,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:22:00,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:22:00,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:22:00,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:22:00,789 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 01:22:00,789 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 01:22:00,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:22:00,790 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 01:22:00,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:22:00,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:22:00,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:22:00,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:22:00,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:22:00,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:22:00,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:22:00,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:22:00,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:22:00,792 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8fb5b6f229e5a4fd597c3d3ce627886ac65e8da3c998565f3e47e3b850a3640 [2024-11-10 01:22:01,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:22:01,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:22:01,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:22:01,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:22:01,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:22:01,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c [2024-11-10 01:22:02,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:22:02,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:22:02,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c [2024-11-10 01:22:02,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c2cf309/e5cb9b3f6f224de4a471b851b86463b7/FLAG9e0340037 [2024-11-10 01:22:02,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c2cf309/e5cb9b3f6f224de4a471b851b86463b7 [2024-11-10 01:22:02,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:22:02,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:22:02,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:22:02,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:22:02,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:22:02,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:22:02" (1/1) ... [2024-11-10 01:22:02,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eecbe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:02, skipping insertion in model container [2024-11-10 01:22:02,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:22:02" (1/1) ... [2024-11-10 01:22:02,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:22:02,841 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/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c[1173,1186] [2024-11-10 01:22:03,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:22:03,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:22:03,082 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/hardware-verification-bv/btor2c-lazyMod.bakery.3.prop1-func-interl.c[1173,1186] [2024-11-10 01:22:03,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:22:03,182 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:22:03,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03 WrapperNode [2024-11-10 01:22:03,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:22:03,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:22:03,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:22:03,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:22:03,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,315 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1649 [2024-11-10 01:22:03,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:22:03,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:22:03,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:22:03,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:22:03,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,354 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:22:03,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:22:03,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:22:03,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:22:03,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:22:03,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (1/1) ... [2024-11-10 01:22:03,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:22:03,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:22:03,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:22:03,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:22:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:22:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 01:22:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:22:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:22:03,771 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:22:03,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:22:05,015 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-10 01:22:05,016 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:22:05,023 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:22:05,025 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:22:05,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:22:05 BoogieIcfgContainer [2024-11-10 01:22:05,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:22:05,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:22:05,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:22:05,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:22:05,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:22:02" (1/3) ... [2024-11-10 01:22:05,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c20351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:22:05, skipping insertion in model container [2024-11-10 01:22:05,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:03" (2/3) ... [2024-11-10 01:22:05,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c20351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:22:05, skipping insertion in model container [2024-11-10 01:22:05,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:22:05" (3/3) ... [2024-11-10 01:22:05,033 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.bakery.3.prop1-func-interl.c [2024-11-10 01:22:05,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:22:05,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:22:05,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:22:05,087 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;@3538da95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:22:05,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:22:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:22:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 01:22:05,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:22:05,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 01:22:05,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:22:05,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:22:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 01:22:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:22:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461274608] [2024-11-10 01:22:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:22:05,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:22:05,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:22:05,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 01:22:05,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 01:22:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:22:05,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 01:22:05,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:22:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:22:05,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:22:05,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:22:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461274608] [2024-11-10 01:22:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461274608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:22:05,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:22:05,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:22:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882140999] [2024-11-10 01:22:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:22:05,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:22:05,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:22:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:22:05,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:22:05,694 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:22:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:22:05,823 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 01:22:05,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:22:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 01:22:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:22:05,831 INFO L225 Difference]: With dead ends: 22 [2024-11-10 01:22:05,831 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 01:22:05,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:22:05,835 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:22:05,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:22:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 01:22:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 01:22:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:22:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 01:22:05,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 01:22:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:22:05,857 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 01:22:05,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:22:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 01:22:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 01:22:05,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:22:05,859 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:22:05,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 01:22:06,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:22:06,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:22:06,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:22:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 01:22:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:22:06,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701910891] [2024-11-10 01:22:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:22:06,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:22:06,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:22:06,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 01:22:06,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 01:22:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:22:06,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 01:22:06,485 INFO L278 TraceCheckSpWp]: Computing forward predicates...