./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.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.h_FIFO.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 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:10:48,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:10:48,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:10:48,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:10:48,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:10:48,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:10:48,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:10:48,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:10:48,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:10:48,842 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:10:48,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:10:48,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:10:48,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:10:48,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:10:48,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:10:48,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:10:48,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:10:48,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:10:48,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:10:48,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:10:48,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:10:48,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:10:48,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:10:48,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:10:48,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:10:48,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:10:48,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:10:48,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:10:48,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:10:48,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:10:48,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:10:48,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:10:48,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:10:48,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:10:48,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:10:48,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:10:48,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:10:48,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:10:48,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:10:48,859 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 -> 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 [2024-11-10 02:10:49,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:10:49,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:10:49,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:10:49,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:10:49,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:10:49,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2024-11-10 02:10:50,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:10:50,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:10:50,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2024-11-10 02:10:50,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fc6525d/3a7b1fdd4320429999a0ca7d738fb45d/FLAGfc57a7463 [2024-11-10 02:10:51,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fc6525d/3a7b1fdd4320429999a0ca7d738fb45d [2024-11-10 02:10:51,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:10:51,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:10:51,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:10:51,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:10:51,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:10:51,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:51,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcfeb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51, skipping insertion in model container [2024-11-10 02:10:51,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:51,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:10:51,540 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.h_FIFO.c[1246,1259] [2024-11-10 02:10:51,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:10:51,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:10:51,851 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.h_FIFO.c[1246,1259] [2024-11-10 02:10:51,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:10:51,996 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:10:51,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51 WrapperNode [2024-11-10 02:10:51,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:10:51,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:10:51,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:10:51,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:10:52,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,228 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1933 [2024-11-10 02:10:52,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:10:52,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:10:52,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:10:52,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:10:52,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,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 02:10:52,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:10:52,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:10:52,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:10:52,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:10:52,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (1/1) ... [2024-11-10 02:10:52,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:10:52,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:10:52,734 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 02:10:52,748 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 02:10:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:10:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:10:52,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:10:52,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:10:53,084 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:10:53,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:10:54,997 INFO L? ?]: Removed 1109 outVars from TransFormulas that were not future-live. [2024-11-10 02:10:54,997 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:10:55,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:10:55,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:10:55,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:10:55 BoogieIcfgContainer [2024-11-10 02:10:55,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:10:55,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:10:55,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:10:55,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:10:55,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:10:51" (1/3) ... [2024-11-10 02:10:55,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6143e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:10:55, skipping insertion in model container [2024-11-10 02:10:55,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:10:51" (2/3) ... [2024-11-10 02:10:55,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6143e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:10:55, skipping insertion in model container [2024-11-10 02:10:55,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:10:55" (3/3) ... [2024-11-10 02:10:55,144 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FIFO.c [2024-11-10 02:10:55,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:10:55,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:10:55,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:10:55,264 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;@6956e655, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:10:55,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:10:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 539 states have (on average 1.4953617810760669) internal successors, (806), 540 states have internal predecessors, (806), 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 02:10:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 02:10:55,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:55,282 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] [2024-11-10 02:10:55,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:55,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash 715565320, now seen corresponding path program 1 times [2024-11-10 02:10:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782000400] [2024-11-10 02:10:55,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:56,652 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 02:10:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:56,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782000400] [2024-11-10 02:10:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782000400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070753006] [2024-11-10 02:10:56,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:56,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:56,695 INFO L87 Difference]: Start difference. First operand has 541 states, 539 states have (on average 1.4953617810760669) internal successors, (806), 540 states have internal predecessors, (806), 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 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 02:10:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:57,107 INFO L93 Difference]: Finished difference Result 1015 states and 1516 transitions. [2024-11-10 02:10:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2024-11-10 02:10:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:57,126 INFO L225 Difference]: With dead ends: 1015 [2024-11-10 02:10:57,126 INFO L226 Difference]: Without dead ends: 536 [2024-11-10 02:10:57,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 02:10:57,137 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 738 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:57,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1313 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-10 02:10:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-11-10 02:10:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4915887850467289) internal successors, (798), 535 states have internal predecessors, (798), 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 02:10:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 798 transitions. [2024-11-10 02:10:57,207 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 798 transitions. Word has length 70 [2024-11-10 02:10:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:57,208 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 798 transitions. [2024-11-10 02:10:57,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 02:10:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 798 transitions. [2024-11-10 02:10:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 02:10:57,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:57,211 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] [2024-11-10 02:10:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:10:57,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:57,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -42791266, now seen corresponding path program 1 times [2024-11-10 02:10:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35416702] [2024-11-10 02:10:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:57,652 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 02:10:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35416702] [2024-11-10 02:10:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35416702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:10:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821387160] [2024-11-10 02:10:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:57,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:10:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:10:57,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:10:57,660 INFO L87 Difference]: Start difference. First operand 536 states and 798 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 02:10:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:57,941 INFO L93 Difference]: Finished difference Result 541 states and 803 transitions. [2024-11-10 02:10:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:10:57,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2024-11-10 02:10:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:57,946 INFO L225 Difference]: With dead ends: 541 [2024-11-10 02:10:57,947 INFO L226 Difference]: Without dead ends: 538 [2024-11-10 02:10:57,948 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 02:10:57,949 INFO L432 NwaCegarLoop]: 664 mSDtfsCounter, 0 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:57,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1987 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 02:10:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-10 02:10:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-10 02:10:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.48975791433892) internal successors, (800), 537 states have internal predecessors, (800), 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 02:10:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 800 transitions. [2024-11-10 02:10:57,967 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 800 transitions. Word has length 72 [2024-11-10 02:10:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:57,967 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 800 transitions. [2024-11-10 02:10:57,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 02:10:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 800 transitions. [2024-11-10 02:10:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 02:10:57,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:57,969 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] [2024-11-10 02:10:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:10:57,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1181475169, now seen corresponding path program 1 times [2024-11-10 02:10:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469928021] [2024-11-10 02:10:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:58,983 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 02:10:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469928021] [2024-11-10 02:10:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469928021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:58,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:10:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83157337] [2024-11-10 02:10:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:10:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:10:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:10:58,989 INFO L87 Difference]: Start difference. First operand 538 states and 800 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 02:10:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:10:59,469 INFO L93 Difference]: Finished difference Result 1146 states and 1700 transitions. [2024-11-10 02:10:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:10:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 73 [2024-11-10 02:10:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:10:59,472 INFO L225 Difference]: With dead ends: 1146 [2024-11-10 02:10:59,473 INFO L226 Difference]: Without dead ends: 670 [2024-11-10 02:10:59,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:10:59,475 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 1144 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:10:59,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1937 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:10:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-10 02:10:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 544. [2024-11-10 02:10:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4880294659300184) internal successors, (808), 543 states have internal predecessors, (808), 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 02:10:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2024-11-10 02:10:59,488 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 73 [2024-11-10 02:10:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:10:59,489 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2024-11-10 02:10:59,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 02:10:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2024-11-10 02:10:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 02:10:59,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:10:59,491 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] [2024-11-10 02:10:59,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:10:59,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:10:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:10:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -696607747, now seen corresponding path program 1 times [2024-11-10 02:10:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:10:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297910573] [2024-11-10 02:10:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:10:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:10:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:10:59,838 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 02:10:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:10:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297910573] [2024-11-10 02:10:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297910573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:10:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:10:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:10:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542218761] [2024-11-10 02:10:59,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:10:59,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:10:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:10:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:10:59,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:10:59,841 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 02:11:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:00,757 INFO L93 Difference]: Finished difference Result 1413 states and 2102 transitions. [2024-11-10 02:11:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 02:11:00,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2024-11-10 02:11:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:00,762 INFO L225 Difference]: With dead ends: 1413 [2024-11-10 02:11:00,762 INFO L226 Difference]: Without dead ends: 548 [2024-11-10 02:11:00,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:11:00,764 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 509 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:00,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 2975 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 02:11:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-10 02:11:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2024-11-10 02:11:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.4862385321100917) internal successors, (810), 545 states have internal predecessors, (810), 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 02:11:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 810 transitions. [2024-11-10 02:11:00,776 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 810 transitions. Word has length 74 [2024-11-10 02:11:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:00,777 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 810 transitions. [2024-11-10 02:11:00,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 02:11:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 810 transitions. [2024-11-10 02:11:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 02:11:00,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:00,807 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] [2024-11-10 02:11:00,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:11:00,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 122757562, now seen corresponding path program 1 times [2024-11-10 02:11:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:00,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13091762] [2024-11-10 02:11:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:01,392 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 02:11:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13091762] [2024-11-10 02:11:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13091762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:11:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439602972] [2024-11-10 02:11:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:01,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:11:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:01,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:11:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:11:01,395 INFO L87 Difference]: Start difference. First operand 546 states and 810 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 02:11:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:01,857 INFO L93 Difference]: Finished difference Result 1162 states and 1721 transitions. [2024-11-10 02:11:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:11:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2024-11-10 02:11:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:01,861 INFO L225 Difference]: With dead ends: 1162 [2024-11-10 02:11:01,861 INFO L226 Difference]: Without dead ends: 684 [2024-11-10 02:11:01,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:01,863 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 1178 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:01,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 2609 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:11:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-10 02:11:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 547. [2024-11-10 02:11:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4853479853479854) internal successors, (811), 546 states have internal predecessors, (811), 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 02:11:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 811 transitions. [2024-11-10 02:11:01,874 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 811 transitions. Word has length 75 [2024-11-10 02:11:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:01,874 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 811 transitions. [2024-11-10 02:11:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 02:11:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 811 transitions. [2024-11-10 02:11:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 02:11:01,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:01,877 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] [2024-11-10 02:11:01,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:11:01,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:01,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1308459932, now seen corresponding path program 1 times [2024-11-10 02:11:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640301130] [2024-11-10 02:11:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:03,260 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 02:11:03,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:03,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640301130] [2024-11-10 02:11:03,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640301130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:03,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:03,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:11:03,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344216744] [2024-11-10 02:11:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:03,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:11:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:03,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:11:03,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:11:03,263 INFO L87 Difference]: Start difference. First operand 547 states and 811 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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 02:11:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:03,921 INFO L93 Difference]: Finished difference Result 1238 states and 1826 transitions. [2024-11-10 02:11:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:11:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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 75 [2024-11-10 02:11:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:03,924 INFO L225 Difference]: With dead ends: 1238 [2024-11-10 02:11:03,925 INFO L226 Difference]: Without dead ends: 760 [2024-11-10 02:11:03,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-10 02:11:03,926 INFO L432 NwaCegarLoop]: 649 mSDtfsCounter, 1480 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:03,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 3400 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:11:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-10 02:11:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 555. [2024-11-10 02:11:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.48014440433213) internal successors, (820), 554 states have internal predecessors, (820), 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 02:11:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 820 transitions. [2024-11-10 02:11:03,938 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 820 transitions. Word has length 75 [2024-11-10 02:11:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:03,939 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 820 transitions. [2024-11-10 02:11:03,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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 02:11:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 820 transitions. [2024-11-10 02:11:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 02:11:03,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:03,940 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] [2024-11-10 02:11:03,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:11:03,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:03,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash 195862550, now seen corresponding path program 1 times [2024-11-10 02:11:03,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:03,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117529320] [2024-11-10 02:11:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:04,694 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 02:11:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:11:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117529320] [2024-11-10 02:11:04,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117529320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:04,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:04,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 02:11:04,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706139064] [2024-11-10 02:11:04,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:04,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:11:04,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:11:04,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:11:04,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 02:11:04,697 INFO L87 Difference]: Start difference. First operand 555 states and 820 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 02:11:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:05,482 INFO L93 Difference]: Finished difference Result 1215 states and 1796 transitions. [2024-11-10 02:11:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 02:11:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 76 [2024-11-10 02:11:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:05,486 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 02:11:05,487 INFO L226 Difference]: Without dead ends: 737 [2024-11-10 02:11:05,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:11:05,491 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 1324 mSDsluCounter, 3062 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:11:05,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 3707 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:11:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-10 02:11:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 600. [2024-11-10 02:11:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4808013355592655) internal successors, (887), 599 states have internal predecessors, (887), 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 02:11:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 887 transitions. [2024-11-10 02:11:05,511 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 887 transitions. Word has length 76 [2024-11-10 02:11:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:05,511 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 887 transitions. [2024-11-10 02:11:05,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 02:11:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 887 transitions. [2024-11-10 02:11:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 02:11:05,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:05,513 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] [2024-11-10 02:11:05,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:11:05,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:05,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2144653829, now seen corresponding path program 1 times [2024-11-10 02:11:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:11:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601060062] [2024-11-10 02:11:05,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:11:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:11:05,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:11:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:11:05,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:11:05,872 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:11:05,873 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:11:05,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:11:05,878 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:05,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:11:05,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:11:05 BoogieIcfgContainer [2024-11-10 02:11:05,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:11:05,991 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:11:05,991 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:11:05,992 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:11:05,992 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:10:55" (3/4) ... [2024-11-10 02:11:05,995 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:11:05,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:11:05,998 INFO L158 Benchmark]: Toolchain (without parser) took 14738.01ms. Allocated memory was 138.4MB in the beginning and 601.9MB in the end (delta: 463.5MB). Free memory was 67.5MB in the beginning and 415.0MB in the end (delta: -347.5MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2024-11-10 02:11:05,998 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:05,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.90ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 67.2MB in the beginning and 114.7MB in the end (delta: -47.5MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-10 02:11:05,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.46ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 68.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-10 02:11:05,999 INFO L158 Benchmark]: Boogie Preprocessor took 402.18ms. Allocated memory is still 169.9MB. Free memory was 68.5MB in the beginning and 101.9MB in the end (delta: -33.4MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-11-10 02:11:05,999 INFO L158 Benchmark]: IcfgBuilder took 2501.64ms. Allocated memory was 169.9MB in the beginning and 318.8MB in the end (delta: 148.9MB). Free memory was 101.9MB in the beginning and 117.8MB in the end (delta: -15.9MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. [2024-11-10 02:11:06,000 INFO L158 Benchmark]: TraceAbstraction took 10853.43ms. Allocated memory was 318.8MB in the beginning and 601.9MB in the end (delta: 283.1MB). Free memory was 117.8MB in the beginning and 416.0MB in the end (delta: -298.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:06,000 INFO L158 Benchmark]: Witness Printer took 6.18ms. Allocated memory is still 601.9MB. Free memory was 416.0MB in the beginning and 415.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:11:06,001 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.24ms. Allocated memory is still 138.4MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.90ms. Allocated memory was 138.4MB in the beginning and 169.9MB in the end (delta: 31.5MB). Free memory was 67.2MB in the beginning and 114.7MB in the end (delta: -47.5MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.46ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 68.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 402.18ms. Allocated memory is still 169.9MB. Free memory was 68.5MB in the beginning and 101.9MB in the end (delta: -33.4MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * IcfgBuilder took 2501.64ms. Allocated memory was 169.9MB in the beginning and 318.8MB in the end (delta: 148.9MB). Free memory was 101.9MB in the beginning and 117.8MB in the end (delta: -15.9MB). Peak memory consumption was 145.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10853.43ms. Allocated memory was 318.8MB in the beginning and 601.9MB in the end (delta: 283.1MB). Free memory was 117.8MB in the beginning and 416.0MB in the end (delta: -298.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.18ms. Allocated memory is still 601.9MB. Free memory was 416.0MB in the beginning and 415.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 263. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L35] const SORT_36 mask_SORT_36 = (SORT_36)-1 >> (sizeof(SORT_36) * 8 - 3); [L36] const SORT_36 msb_SORT_36 = (SORT_36)1 << (3 - 1); [L38] const SORT_206 mask_SORT_206 = (SORT_206)-1 >> (sizeof(SORT_206) * 8 - 2); [L39] const SORT_206 msb_SORT_206 = (SORT_206)1 << (2 - 1); [L41] const SORT_1 var_10 = 0; [L42] const SORT_13 var_15 = 4; [L43] const SORT_5 var_22 = 1; [L44] const SORT_36 var_38 = 1; [L45] const SORT_36 var_43 = 2; [L46] const SORT_36 var_50 = 4; [L47] const SORT_36 var_53 = 3; [L48] const SORT_13 var_81 = 1; [L49] const SORT_13 var_101 = 0; [L50] const SORT_5 var_149 = 0; [L51] const SORT_1 var_186 = 15; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L55] SORT_1 input_4; [L56] SORT_5 input_6; [L57] SORT_1 input_7; [L58] SORT_5 input_8; [L59] SORT_5 input_9; [L60] SORT_13 input_94; [L61] SORT_1 input_96; [L62] SORT_1 input_107; [L63] SORT_1 input_112; [L64] SORT_1 input_114; [L65] SORT_1 input_129; [L66] SORT_5 input_140; [L67] SORT_5 input_144; [L68] SORT_5 input_147; [L69] SORT_5 input_152; [L70] SORT_5 input_155; [L71] SORT_5 input_158; [L72] SORT_1 input_173; [L73] SORT_1 input_176; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L75] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L76] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L77] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L78] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L79] SORT_5 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L80] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L81] SORT_1 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L82] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L83] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L84] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L85] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L86] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L87] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L88] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L89] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] SORT_1 init_12_arg_1 = var_10; [L92] state_11 = init_12_arg_1 [L93] SORT_1 init_18_arg_1 = var_10; [L94] state_17 = init_18_arg_1 [L95] SORT_1 init_20_arg_1 = var_10; [L96] state_19 = init_20_arg_1 [L97] SORT_5 init_24_arg_1 = var_22; [L98] state_23 = init_24_arg_1 [L99] SORT_5 init_29_arg_1 = var_22; [L100] state_28 = init_29_arg_1 [L101] SORT_1 init_33_arg_1 = var_10; [L102] state_32 = init_33_arg_1 [L103] SORT_1 init_35_arg_1 = var_10; [L104] state_34 = init_35_arg_1 [L105] SORT_1 init_42_arg_1 = var_10; [L106] state_41 = init_42_arg_1 [L107] SORT_1 init_47_arg_1 = var_10; [L108] state_46 = init_47_arg_1 [L109] SORT_1 init_49_arg_1 = var_10; [L110] state_48 = init_49_arg_1 [L111] SORT_1 init_58_arg_1 = var_10; [L112] state_57 = init_58_arg_1 [L113] SORT_1 init_60_arg_1 = var_10; [L114] state_59 = init_60_arg_1 [L115] SORT_1 init_64_arg_1 = var_10; [L116] state_63 = init_64_arg_1 [L117] SORT_1 init_66_arg_1 = var_10; [L118] state_65 = init_66_arg_1 [L119] SORT_1 init_71_arg_1 = var_10; [L120] state_70 = init_71_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L123] input_2 = __VERIFIER_nondet_uchar() [L124] input_3 = __VERIFIER_nondet_uchar() [L125] input_4 = __VERIFIER_nondet_uchar() [L126] input_6 = __VERIFIER_nondet_uchar() [L127] input_7 = __VERIFIER_nondet_uchar() [L128] input_8 = __VERIFIER_nondet_uchar() [L129] input_9 = __VERIFIER_nondet_uchar() [L130] input_94 = __VERIFIER_nondet_uint() [L131] input_96 = __VERIFIER_nondet_uchar() [L132] input_107 = __VERIFIER_nondet_uchar() [L133] input_112 = __VERIFIER_nondet_uchar() [L134] input_114 = __VERIFIER_nondet_uchar() [L135] input_129 = __VERIFIER_nondet_uchar() [L136] input_140 = __VERIFIER_nondet_uchar() [L137] input_144 = __VERIFIER_nondet_uchar() [L138] input_147 = __VERIFIER_nondet_uchar() [L139] input_152 = __VERIFIER_nondet_uchar() [L140] input_155 = __VERIFIER_nondet_uchar() [L141] input_158 = __VERIFIER_nondet_uchar() [L142] input_173 = __VERIFIER_nondet_uchar() [L143] input_176 = __VERIFIER_nondet_uchar() [L146] SORT_1 var_14_arg_0 = state_11; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_14_arg_0=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L147] EXPR var_14_arg_0 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L147] var_14_arg_0 = var_14_arg_0 & mask_SORT_1 [L148] SORT_13 var_14 = var_14_arg_0; [L149] SORT_13 var_16_arg_0 = var_14; [L150] SORT_13 var_16_arg_1 = var_15; [L151] SORT_5 var_16 = var_16_arg_0 == var_16_arg_1; [L152] SORT_1 var_21_arg_0 = state_17; [L153] SORT_1 var_21_arg_1 = state_19; [L154] SORT_5 var_21 = var_21_arg_0 == var_21_arg_1; [L155] SORT_5 var_25_arg_0 = state_23; [L156] SORT_5 var_25 = ~var_25_arg_0; [L157] SORT_5 var_26_arg_0 = var_21; [L158] SORT_5 var_26_arg_1 = var_25; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26_arg_0=1, var_26_arg_1=-2, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L159] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L159] SORT_5 var_26 = var_26_arg_0 & var_26_arg_1; [L160] EXPR var_26 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L160] var_26 = var_26 & mask_SORT_5 [L161] SORT_5 var_27_arg_0 = var_16; [L162] SORT_5 var_27_arg_1 = var_26; [L163] SORT_5 var_27 = var_27_arg_0 == var_27_arg_1; [L164] SORT_5 var_30_arg_0 = state_28; [L165] SORT_5 var_30_arg_1 = state_23; [L166] SORT_5 var_30 = var_30_arg_0 == var_30_arg_1; [L167] SORT_5 var_31_arg_0 = var_27; [L168] SORT_5 var_31_arg_1 = var_30; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31_arg_0=0, var_31_arg_1=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L169] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L169] SORT_5 var_31 = var_31_arg_0 & var_31_arg_1; [L170] SORT_1 var_37_arg_0 = state_11; [L171] SORT_36 var_37 = var_37_arg_0 >> 0; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L172] EXPR var_37 & mask_SORT_36 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L172] var_37 = var_37 & mask_SORT_36 [L173] SORT_36 var_54_arg_0 = var_37; [L174] SORT_36 var_54_arg_1 = var_53; [L175] SORT_5 var_54 = var_54_arg_0 == var_54_arg_1; [L176] SORT_36 var_51_arg_0 = var_37; [L177] SORT_36 var_51_arg_1 = var_50; [L178] SORT_5 var_51 = var_51_arg_0 == var_51_arg_1; [L179] SORT_5 var_55_arg_0 = var_54; [L180] SORT_5 var_55_arg_1 = var_51; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_55_arg_0=0, var_55_arg_1=0, var_81=1] [L181] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_81=1] [L181] SORT_5 var_55 = var_55_arg_0 | var_55_arg_1; [L182] EXPR var_55 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_37=0, var_38=1, var_43=2, var_50=4, var_51=0, var_53=3, var_81=1] [L182] var_55 = var_55 & mask_SORT_5 [L183] SORT_5 var_52_arg_0 = var_51; [L184] SORT_1 var_52_arg_1 = state_48; [L185] SORT_1 var_52_arg_2 = state_46; [L186] SORT_1 var_52 = var_52_arg_0 ? var_52_arg_1 : var_52_arg_2; [L187] SORT_36 var_44_arg_0 = var_37; [L188] SORT_36 var_44_arg_1 = var_43; [L189] SORT_5 var_44 = var_44_arg_0 == var_44_arg_1; [L190] SORT_36 var_39_arg_0 = var_37; [L191] SORT_36 var_39_arg_1 = var_38; [L192] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L193] SORT_5 var_40_arg_0 = var_39; [L194] SORT_1 var_40_arg_1 = state_34; [L195] SORT_1 var_40_arg_2 = state_32; [L196] SORT_1 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; [L197] SORT_5 var_45_arg_0 = var_44; [L198] SORT_1 var_45_arg_1 = state_41; [L199] SORT_1 var_45_arg_2 = var_40; [L200] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L201] SORT_5 var_56_arg_0 = var_55; [L202] SORT_1 var_56_arg_1 = var_52; [L203] SORT_1 var_56_arg_2 = var_45; [L204] SORT_1 var_56 = var_56_arg_0 ? var_56_arg_1 : var_56_arg_2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L205] EXPR var_56 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L205] var_56 = var_56 & mask_SORT_1 [L206] SORT_1 var_75_arg_0 = state_17; [L207] SORT_5 var_75 = var_75_arg_0 >> 2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_75=0, var_81=1] [L208] EXPR var_75 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L208] var_75 = var_75 & mask_SORT_5 [L209] SORT_1 var_68_arg_0 = state_17; [L210] SORT_5 var_68 = var_68_arg_0 >> 1; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_68=0, var_75=0, var_81=1] [L211] EXPR var_68 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_75=0, var_81=1] [L211] var_68 = var_68 & mask_SORT_5 [L212] SORT_1 var_61_arg_0 = state_17; [L213] SORT_5 var_61 = var_61_arg_0 >> 0; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_61=0, var_68=0, var_75=0, var_81=1] [L214] EXPR var_61 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_68=0, var_75=0, var_81=1] [L214] var_61 = var_61 & mask_SORT_5 [L215] SORT_5 var_73_arg_0 = var_61; [L216] SORT_1 var_73_arg_1 = input_4; [L217] SORT_1 var_73_arg_2 = input_3; [L218] SORT_1 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L219] SORT_5 var_72_arg_0 = var_61; [L220] SORT_1 var_72_arg_1 = input_2; [L221] SORT_1 var_72_arg_2 = state_70; [L222] SORT_1 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L223] SORT_5 var_74_arg_0 = var_68; [L224] SORT_1 var_74_arg_1 = var_73; [L225] SORT_1 var_74_arg_2 = var_72; [L226] SORT_1 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L227] SORT_5 var_67_arg_0 = var_61; [L228] SORT_1 var_67_arg_1 = state_65; [L229] SORT_1 var_67_arg_2 = state_63; [L230] SORT_1 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L231] SORT_5 var_62_arg_0 = var_61; [L232] SORT_1 var_62_arg_1 = state_59; [L233] SORT_1 var_62_arg_2 = state_57; [L234] SORT_1 var_62 = var_62_arg_0 ? var_62_arg_1 : var_62_arg_2; [L235] SORT_5 var_69_arg_0 = var_68; [L236] SORT_1 var_69_arg_1 = var_67; [L237] SORT_1 var_69_arg_2 = var_62; [L238] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L239] SORT_5 var_76_arg_0 = var_75; [L240] SORT_1 var_76_arg_1 = var_74; [L241] SORT_1 var_76_arg_2 = var_69; [L242] SORT_1 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_76=0, var_81=1] [L243] EXPR var_76 & mask_SORT_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_56=0, var_81=1] [L243] var_76 = var_76 & mask_SORT_1 [L244] SORT_1 var_77_arg_0 = var_56; [L245] SORT_1 var_77_arg_1 = var_76; [L246] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L247] SORT_5 var_78_arg_0 = state_28; [L248] SORT_5 var_78_arg_1 = var_77; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_78_arg_0=1, var_78_arg_1=1, var_81=1] [L249] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_31=0, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L249] SORT_5 var_78 = var_78_arg_0 | var_78_arg_1; [L250] SORT_5 var_79_arg_0 = var_31; [L251] SORT_5 var_79_arg_1 = var_78; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_79_arg_0=0, var_79_arg_1=1, var_81=1] [L252] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L252] SORT_5 var_79 = var_79_arg_0 & var_79_arg_1; [L253] SORT_5 var_80_arg_0 = var_79; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_80_arg_0=0, var_81=1] [L254] EXPR var_80_arg_0 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L254] var_80_arg_0 = var_80_arg_0 & mask_SORT_5 [L255] SORT_13 var_80 = var_80_arg_0; [L256] SORT_13 var_82_arg_0 = var_80; [L257] SORT_13 var_82_arg_1 = var_81; [L258] SORT_5 var_82 = var_82_arg_0 == var_82_arg_1; [L259] SORT_5 var_85_arg_0 = var_82; [L260] SORT_5 var_85 = ~var_85_arg_0; [L261] SORT_5 var_86_arg_0 = var_22; [L262] SORT_5 var_86_arg_1 = var_85; VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1, var_86_arg_0=1, var_86_arg_1=-1] [L263] EXPR var_86_arg_0 & var_86_arg_1 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L263] SORT_5 var_86 = var_86_arg_0 & var_86_arg_1; [L264] EXPR var_86 & mask_SORT_5 VAL [mask_SORT_1=15, mask_SORT_206=3, mask_SORT_36=7, mask_SORT_5=1, state_11=0, state_17=0, state_19=0, state_23=1, state_28=1, state_32=0, state_34=0, state_41=0, state_46=0, state_48=0, state_57=0, state_59=0, state_63=0, state_65=0, state_70=0, var_101=0, var_10=0, var_149=0, var_15=4, var_16=0, var_186=15, var_22=1, var_26=1, var_38=1, var_43=2, var_50=4, var_53=3, var_81=1] [L264] var_86 = var_86 & mask_SORT_5 [L265] SORT_5 bad_87_arg_0 = var_86; [L266] CALL __VERIFIER_assert(!(bad_87_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 541 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6373 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6373 mSDsluCounter, 17928 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13386 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4507 IncrementalHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 4542 mSDtfsCounter, 4507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 607 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 02:11:06,045 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.h_FIFO.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 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:11:08,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:11:08,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:11:08,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:11:08,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:11:08,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:11:08,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:11:08,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:11:08,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:11:08,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:11:08,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:11:08,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:11:08,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:11:08,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:11:08,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:11:08,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:11:08,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:11:08,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:11:08,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:11:08,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:11:08,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:11:08,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:11:08,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:11:08,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:11:08,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:11:08,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:11:08,499 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:11:08,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:11:08,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:11:08,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:11:08,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:11:08,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:11:08,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:11:08,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:11:08,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:11:08,503 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:11:08,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:11:08,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:11:08,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:11:08,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:11:08,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:11:08,504 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 -> 56f86b4cab001f7d30235f7e21f0d2866e7fb9bade2974e05f17edebfb7e1bb0 [2024-11-10 02:11:08,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:11:08,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:11:08,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:11:08,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:11:08,898 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:11:08,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2024-11-10 02:11:10,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:11:10,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:11:10,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FIFO.c [2024-11-10 02:11:10,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a310f393d/215edc33948b4744b5ecc1eee4bae45d/FLAGcb86c03a4 [2024-11-10 02:11:10,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a310f393d/215edc33948b4744b5ecc1eee4bae45d [2024-11-10 02:11:10,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:11:10,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:11:10,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:10,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:11:10,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:11:10,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:10" (1/1) ... [2024-11-10 02:11:10,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:10, skipping insertion in model container [2024-11-10 02:11:10,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:11:10" (1/1) ... [2024-11-10 02:11:10,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:11:11,081 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.h_FIFO.c[1246,1259] [2024-11-10 02:11:11,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:11,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:11:11,322 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.h_FIFO.c[1246,1259] [2024-11-10 02:11:11,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:11:11,453 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:11:11,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11 WrapperNode [2024-11-10 02:11:11,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:11:11,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:11:11,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:11:11,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:11:11,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,577 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 877 [2024-11-10 02:11:11,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:11:11,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:11:11,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:11:11,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:11:11,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,646 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 02:11:11,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:11:11,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:11:11,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:11:11,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:11:11,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (1/1) ... [2024-11-10 02:11:11,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:11:11,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:11:11,751 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 02:11:11,755 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 02:11:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:11:11,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:11:11,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:11:11,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:11:12,101 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:11:12,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:11:12,930 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-11-10 02:11:12,930 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:11:12,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:11:12,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:11:12,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:11:12 BoogieIcfgContainer [2024-11-10 02:11:12,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:11:12,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:11:12,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:11:12,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:11:12,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:11:10" (1/3) ... [2024-11-10 02:11:12,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1714bced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:11:12, skipping insertion in model container [2024-11-10 02:11:12,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:11:11" (2/3) ... [2024-11-10 02:11:12,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1714bced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:11:12, skipping insertion in model container [2024-11-10 02:11:12,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:11:12" (3/3) ... [2024-11-10 02:11:12,955 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FIFO.c [2024-11-10 02:11:12,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:11:12,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:11:13,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:11:13,045 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;@7c9be25d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:11:13,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:11:13,051 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 02:11:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:11:13,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:13,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:11:13,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:11:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:11:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040143806] [2024-11-10 02:11:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:13,081 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 02:11:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:11:13,084 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 02:11:13,085 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 02:11:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:13,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 02:11:13,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:11:13,799 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 02:11:13,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:11:13,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:11:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040143806] [2024-11-10 02:11:13,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040143806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:11:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:11:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:11:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438784337] [2024-11-10 02:11:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:11:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:11:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:11:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:11:13,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:11:13,833 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 02:11:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:11:13,927 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 02:11:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:11:13,930 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 02:11:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:11:13,937 INFO L225 Difference]: With dead ends: 22 [2024-11-10 02:11:13,937 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 02:11:13,940 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 02:11:13,945 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 02:11:13,946 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 02:11:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 02:11:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 02:11:13,977 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 02:11:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:11:13,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:11:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:11:13,979 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:11:13,979 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 02:11:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:11:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:11:13,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:11:13,980 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:11:13,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 02:11:14,181 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 02:11:14,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:11:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:11:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:11:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:11:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167133665] [2024-11-10 02:11:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:11:14,183 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 02:11:14,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:11:14,185 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 02:11:14,186 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 02:11:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:11:14,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-10 02:11:14,705 INFO L278 TraceCheckSpWp]: Computing forward predicates...