./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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.vis_QF_BV_fru32_p3.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 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:00:46,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:00:46,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 03:00:46,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:00:46,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:00:46,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:00:46,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:00:46,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:00:46,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:00:46,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:00:46,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:00:46,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:00:46,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:00:46,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:00:46,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:00:46,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:00:46,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:00:46,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:00:46,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:00:46,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:00:46,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:00:46,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:00:46,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:00:46,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:00:46,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:00:46,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:00:46,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:00:46,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:00:46,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:00:46,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:46,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:00:46,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:00:46,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:00:46,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:00:46,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:00:46,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:00:46,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:00:46,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:00:46,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:00:46,920 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 -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2024-11-10 03:00:47,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:00:47,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:00:47,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:00:47,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:00:47,204 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:00:47,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-10 03:00:48,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:00:48,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:00:48,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-10 03:00:48,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44221cf4/765859a0ca5549bf973f30c484eff5d7/FLAG2fee45c3e [2024-11-10 03:00:48,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44221cf4/765859a0ca5549bf973f30c484eff5d7 [2024-11-10 03:00:48,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:00:48,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:00:48,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:48,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:00:48,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:00:48,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:48" (1/1) ... [2024-11-10 03:00:48,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558b4213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:48, skipping insertion in model container [2024-11-10 03:00:48,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:48" (1/1) ... [2024-11-10 03:00:49,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:00:49,213 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.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-10 03:00:49,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:49,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:00:49,406 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.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-10 03:00:49,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:49,487 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:00:49,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49 WrapperNode [2024-11-10 03:00:49,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:49,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:49,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:00:49,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:00:49,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,630 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 931 [2024-11-10 03:00:49,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:49,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:00:49,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:00:49,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:00:49,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,714 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 03:00:49,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:00:49,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:00:49,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:00:49,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:00:49,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (1/1) ... [2024-11-10 03:00:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:00:49,845 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 03:00:49,851 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 03:00:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:00:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:00:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:00:49,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:00:50,069 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:00:50,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:00:51,250 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2024-11-10 03:00:51,250 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:00:51,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:00:51,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:00:51,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:51 BoogieIcfgContainer [2024-11-10 03:00:51,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:00:51,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:00:51,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:00:51,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:00:51,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:00:48" (1/3) ... [2024-11-10 03:00:51,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70aea3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:51, skipping insertion in model container [2024-11-10 03:00:51,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:49" (2/3) ... [2024-11-10 03:00:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70aea3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:51, skipping insertion in model container [2024-11-10 03:00:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:51" (3/3) ... [2024-11-10 03:00:51,328 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-10 03:00:51,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:00:51,349 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:00:51,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:00:51,432 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;@17102b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:00:51,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:00:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 244 states have internal predecessors, (362), 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 03:00:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 03:00:51,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:51,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:51,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1416632532, now seen corresponding path program 1 times [2024-11-10 03:00:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815368556] [2024-11-10 03:00:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:52,685 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 03:00:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:52,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815368556] [2024-11-10 03:00:52,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815368556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880756038] [2024-11-10 03:00:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:52,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:52,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:52,730 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 244 states have internal predecessors, (362), 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 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:52,962 INFO L93 Difference]: Finished difference Result 417 states and 619 transitions. [2024-11-10 03:00:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:52,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-10 03:00:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:52,975 INFO L225 Difference]: With dead ends: 417 [2024-11-10 03:00:52,978 INFO L226 Difference]: Without dead ends: 242 [2024-11-10 03:00:52,981 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 03:00:52,986 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:52,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 883 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:00:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-10 03:00:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-10 03:00:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 241 states have internal predecessors, (358), 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 03:00:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 358 transitions. [2024-11-10 03:00:53,045 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 358 transitions. Word has length 112 [2024-11-10 03:00:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:53,046 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 358 transitions. [2024-11-10 03:00:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 358 transitions. [2024-11-10 03:00:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 03:00:53,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:53,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:53,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:00:53,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:53,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1110988944, now seen corresponding path program 1 times [2024-11-10 03:00:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741587508] [2024-11-10 03:00:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:53,508 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 03:00:53,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:53,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741587508] [2024-11-10 03:00:53,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741587508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:53,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:53,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551778103] [2024-11-10 03:00:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:53,512 INFO L87 Difference]: Start difference. First operand 242 states and 358 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:53,658 INFO L93 Difference]: Finished difference Result 416 states and 615 transitions. [2024-11-10 03:00:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-10 03:00:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:53,661 INFO L225 Difference]: With dead ends: 416 [2024-11-10 03:00:53,662 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 03:00:53,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:53,668 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:53,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 880 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:00:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 03:00:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-10 03:00:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4814814814814814) internal successors, (360), 243 states have internal predecessors, (360), 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 03:00:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2024-11-10 03:00:53,690 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 113 [2024-11-10 03:00:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:53,691 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2024-11-10 03:00:53,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2024-11-10 03:00:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 03:00:53,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:53,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:53,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:00:53,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash -171837511, now seen corresponding path program 1 times [2024-11-10 03:00:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616872236] [2024-11-10 03:00:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:54,730 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 03:00:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616872236] [2024-11-10 03:00:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616872236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787018534] [2024-11-10 03:00:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:54,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:54,733 INFO L87 Difference]: Start difference. First operand 244 states and 360 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 03:00:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:54,916 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2024-11-10 03:00:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:54,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2024-11-10 03:00:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:54,918 INFO L225 Difference]: With dead ends: 418 [2024-11-10 03:00:54,918 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 03:00:54,919 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 03:00:54,924 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 18 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:54,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 855 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:00:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 03:00:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-10 03:00:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.477366255144033) internal successors, (359), 243 states have internal predecessors, (359), 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 03:00:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 359 transitions. [2024-11-10 03:00:54,942 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 359 transitions. Word has length 114 [2024-11-10 03:00:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:54,943 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 359 transitions. [2024-11-10 03:00:54,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 03:00:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 359 transitions. [2024-11-10 03:00:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 03:00:54,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:54,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:00:54,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1672667179, now seen corresponding path program 1 times [2024-11-10 03:00:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231627755] [2024-11-10 03:00:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:56,299 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 03:00:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231627755] [2024-11-10 03:00:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231627755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:00:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69719876] [2024-11-10 03:00:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:56,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:00:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:00:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:00:56,303 INFO L87 Difference]: Start difference. First operand 244 states and 359 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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 03:00:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:56,677 INFO L93 Difference]: Finished difference Result 442 states and 649 transitions. [2024-11-10 03:00:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:00:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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 115 [2024-11-10 03:00:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:56,681 INFO L225 Difference]: With dead ends: 442 [2024-11-10 03:00:56,681 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 03:00:56,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:00:56,686 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 312 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:56,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1656 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:00:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 03:00:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2024-11-10 03:00:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.471698113207547) internal successors, (390), 265 states have internal predecessors, (390), 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 03:00:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 390 transitions. [2024-11-10 03:00:56,703 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 390 transitions. Word has length 115 [2024-11-10 03:00:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:56,707 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 390 transitions. [2024-11-10 03:00:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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 03:00:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 390 transitions. [2024-11-10 03:00:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 03:00:56,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:56,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:56,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:00:56,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1492453454, now seen corresponding path program 1 times [2024-11-10 03:00:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075368492] [2024-11-10 03:00:56,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:56,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:57,936 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 03:00:57,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:57,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075368492] [2024-11-10 03:00:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075368492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:57,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:57,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:00:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845242368] [2024-11-10 03:00:57,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:57,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:00:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:00:57,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:00:57,941 INFO L87 Difference]: Start difference. First operand 266 states and 390 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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 03:00:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:58,388 INFO L93 Difference]: Finished difference Result 486 states and 711 transitions. [2024-11-10 03:00:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:00:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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 116 [2024-11-10 03:00:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:58,391 INFO L225 Difference]: With dead ends: 486 [2024-11-10 03:00:58,391 INFO L226 Difference]: Without dead ends: 290 [2024-11-10 03:00:58,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:00:58,393 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 279 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:58,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1753 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:00:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-10 03:00:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 266. [2024-11-10 03:00:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.471698113207547) internal successors, (390), 265 states have internal predecessors, (390), 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 03:00:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 390 transitions. [2024-11-10 03:00:58,409 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 390 transitions. Word has length 116 [2024-11-10 03:00:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:58,410 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 390 transitions. [2024-11-10 03:00:58,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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 03:00:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 390 transitions. [2024-11-10 03:00:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 03:00:58,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:58,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:58,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:00:58,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:58,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash 932324740, now seen corresponding path program 1 times [2024-11-10 03:00:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260966827] [2024-11-10 03:00:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:59,897 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 03:00:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260966827] [2024-11-10 03:00:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260966827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:00:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142420775] [2024-11-10 03:00:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:00:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:00:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:00:59,902 INFO L87 Difference]: Start difference. First operand 266 states and 390 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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 03:01:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:01:00,339 INFO L93 Difference]: Finished difference Result 489 states and 714 transitions. [2024-11-10 03:01:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:01:00,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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 116 [2024-11-10 03:01:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:01:00,342 INFO L225 Difference]: With dead ends: 489 [2024-11-10 03:01:00,342 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 03:01:00,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:01:00,343 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 313 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:01:00,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1645 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:01:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 03:01:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 288. [2024-11-10 03:01:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.470383275261324) internal successors, (422), 287 states have internal predecessors, (422), 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 03:01:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 422 transitions. [2024-11-10 03:01:00,353 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 422 transitions. Word has length 116 [2024-11-10 03:01:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:01:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 422 transitions. [2024-11-10 03:01:00,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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 03:01:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 422 transitions. [2024-11-10 03:01:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 03:01:00,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:01:00,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:01:00,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:01:00,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:01:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:01:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2145342987, now seen corresponding path program 1 times [2024-11-10 03:01:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:01:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970388548] [2024-11-10 03:01:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:01:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:01:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:01:01,233 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 03:01:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:01:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970388548] [2024-11-10 03:01:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970388548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:01:01,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:01:01,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:01:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193240056] [2024-11-10 03:01:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:01:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:01:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:01:01,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:01:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:01:01,236 INFO L87 Difference]: Start difference. First operand 288 states and 422 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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 03:01:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:01:01,452 INFO L93 Difference]: Finished difference Result 532 states and 775 transitions. [2024-11-10 03:01:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:01:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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 116 [2024-11-10 03:01:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:01:01,455 INFO L225 Difference]: With dead ends: 532 [2024-11-10 03:01:01,455 INFO L226 Difference]: Without dead ends: 314 [2024-11-10 03:01:01,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:01:01,458 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 5 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:01:01,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1443 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:01:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-10 03:01:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 300. [2024-11-10 03:01:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4615384615384615) internal successors, (437), 299 states have internal predecessors, (437), 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 03:01:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 437 transitions. [2024-11-10 03:01:01,468 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 437 transitions. Word has length 116 [2024-11-10 03:01:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:01:01,469 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 437 transitions. [2024-11-10 03:01:01,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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 03:01:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 437 transitions. [2024-11-10 03:01:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:01:01,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:01:01,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:01:01,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:01:01,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:01:01,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:01:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1597832925, now seen corresponding path program 1 times [2024-11-10 03:01:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:01:01,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225293091] [2024-11-10 03:01:01,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:01:01,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:01:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:01:02,699 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 03:01:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:01:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225293091] [2024-11-10 03:01:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225293091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:01:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:01:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:01:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315874676] [2024-11-10 03:01:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:01:02,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:01:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:01:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:01:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:01:02,703 INFO L87 Difference]: Start difference. First operand 300 states and 437 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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 03:01:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:01:03,016 INFO L93 Difference]: Finished difference Result 594 states and 865 transitions. [2024-11-10 03:01:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:01:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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 117 [2024-11-10 03:01:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:01:03,019 INFO L225 Difference]: With dead ends: 594 [2024-11-10 03:01:03,019 INFO L226 Difference]: Without dead ends: 364 [2024-11-10 03:01:03,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:01:03,020 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 375 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:01:03,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1743 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:01:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-10 03:01:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2024-11-10 03:01:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.4629080118694362) internal successors, (493), 337 states have internal predecessors, (493), 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 03:01:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 493 transitions. [2024-11-10 03:01:03,028 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 493 transitions. Word has length 117 [2024-11-10 03:01:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:01:03,028 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 493 transitions. [2024-11-10 03:01:03,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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 03:01:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 493 transitions. [2024-11-10 03:01:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:01:03,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:01:03,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:01:03,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:01:03,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:01:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:01:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash 673845180, now seen corresponding path program 1 times [2024-11-10 03:01:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:01:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537593305] [2024-11-10 03:01:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:01:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:01:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:01:03,944 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 03:01:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:01:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537593305] [2024-11-10 03:01:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537593305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:01:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:01:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:01:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990207418] [2024-11-10 03:01:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:01:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:01:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:01:03,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:01:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:01:03,948 INFO L87 Difference]: Start difference. First operand 338 states and 493 transitions. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 03:01:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:01:04,584 INFO L93 Difference]: Finished difference Result 754 states and 1096 transitions. [2024-11-10 03:01:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 03:01:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 117 [2024-11-10 03:01:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:01:04,591 INFO L225 Difference]: With dead ends: 754 [2024-11-10 03:01:04,591 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 03:01:04,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:01:04,593 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 492 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:01:04,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2088 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:01:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 03:01:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-11-10 03:01:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.4572271386430677) internal successors, (494), 339 states have internal predecessors, (494), 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 03:01:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 494 transitions. [2024-11-10 03:01:04,604 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 494 transitions. Word has length 117 [2024-11-10 03:01:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:01:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 494 transitions. [2024-11-10 03:01:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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 03:01:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2024-11-10 03:01:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:01:04,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:01:04,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:01:04,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:01:04,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:01:04,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:01:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1015637637, now seen corresponding path program 1 times [2024-11-10 03:01:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:01:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506213452] [2024-11-10 03:01:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:01:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:01:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:01:05,040 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 03:01:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:01:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506213452] [2024-11-10 03:01:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506213452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:01:05,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:01:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:01:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963845529] [2024-11-10 03:01:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:01:05,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:01:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:01:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:01:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:01:05,044 INFO L87 Difference]: Start difference. First operand 340 states and 494 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 03:01:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:01:05,303 INFO L93 Difference]: Finished difference Result 612 states and 887 transitions. [2024-11-10 03:01:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:01:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 118 [2024-11-10 03:01:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:01:05,305 INFO L225 Difference]: With dead ends: 612 [2024-11-10 03:01:05,305 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 03:01:05,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:01:05,306 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:01:05,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1071 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:01:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 03:01:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-10 03:01:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.4545454545454546) internal successors, (496), 341 states have internal predecessors, (496), 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 03:01:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 496 transitions. [2024-11-10 03:01:05,315 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 496 transitions. Word has length 118 [2024-11-10 03:01:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:01:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 496 transitions. [2024-11-10 03:01:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 03:01:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 496 transitions. [2024-11-10 03:01:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:01:05,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:01:05,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:01:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:01:05,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:01:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:01:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 4149625, now seen corresponding path program 1 times [2024-11-10 03:01:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:01:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966767796] [2024-11-10 03:01:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:01:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:01:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:01:05,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:01:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:01:05,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:01:05,758 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:01:05,759 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:01:05,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 03:01:05,764 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:01:05,881 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:01:05,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:01:05 BoogieIcfgContainer [2024-11-10 03:01:05,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:01:05,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:01:05,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:01:05,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:01:05,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:51" (3/4) ... [2024-11-10 03:01:05,888 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:01:05,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:01:05,890 INFO L158 Benchmark]: Toolchain (without parser) took 16922.92ms. Allocated memory was 169.9MB in the beginning and 723.5MB in the end (delta: 553.6MB). Free memory was 114.7MB in the beginning and 343.0MB in the end (delta: -228.3MB). Peak memory consumption was 327.0MB. Max. memory is 16.1GB. [2024-11-10 03:01:05,890 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 169.9MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:01:05,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.28ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 90.8MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:05,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.60ms. Allocated memory is still 169.9MB. Free memory was 90.8MB in the beginning and 71.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 03:01:05,891 INFO L158 Benchmark]: Boogie Preprocessor took 173.13ms. Allocated memory is still 169.9MB. Free memory was 71.1MB in the beginning and 61.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 03:01:05,891 INFO L158 Benchmark]: IcfgBuilder took 1511.31ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 60.8MB in the beginning and 187.4MB in the end (delta: -126.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:05,891 INFO L158 Benchmark]: TraceAbstraction took 14563.91ms. Allocated memory was 272.6MB in the beginning and 723.5MB in the end (delta: 450.9MB). Free memory was 186.3MB in the beginning and 344.0MB in the end (delta: -157.7MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:05,892 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 723.5MB. Free memory was 344.0MB in the beginning and 343.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:01:05,893 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.28ms. Allocated memory is still 169.9MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.28ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 90.8MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 141.60ms. Allocated memory is still 169.9MB. Free memory was 90.8MB in the beginning and 71.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 173.13ms. Allocated memory is still 169.9MB. Free memory was 71.1MB in the beginning and 61.1MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1511.31ms. Allocated memory was 169.9MB in the beginning and 272.6MB in the end (delta: 102.8MB). Free memory was 60.8MB in the beginning and 187.4MB in the end (delta: -126.6MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14563.91ms. Allocated memory was 272.6MB in the beginning and 723.5MB in the end (delta: 450.9MB). Free memory was 186.3MB in the beginning and 344.0MB in the end (delta: -157.7MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 723.5MB. Free memory was 344.0MB in the beginning and 343.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 bitwiseOr at line 325, overapproximation of bitwiseAnd at line 332. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] EXPR var_27 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_71_arg_0=0, var_71_arg_1=1, var_89=0] [L179] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_75_arg_0=0, var_75_arg_1=1, var_89=0] [L185] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_79_arg_0=0, var_79_arg_1=0, var_89=0] [L191] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83_arg_0=0, var_83_arg_1=0, var_89=0] [L197] EXPR var_83_arg_0 & var_83_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] EXPR var_44 & mask_SORT_43 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85_arg_0=0, var_85_arg_1=1, var_89=0] [L206] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] EXPR var_85 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_54_arg_0=0, var_54_arg_1=1, var_66=3, var_85=0, var_89=0] [L216] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_58_arg_0=0, var_58_arg_1=0, var_66=3, var_85=0, var_89=0] [L222] EXPR var_58_arg_0 & var_58_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_62_arg_0=0, var_62_arg_1=0, var_66=3, var_85=0, var_89=0] [L228] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_64_arg_0=0, var_64_arg_1=1, var_66=3, var_85=0, var_89=0] [L234] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] EXPR var_64 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_33_arg_0=0, var_33_arg_1=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_38_arg_0=0, var_38_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_42_arg_0=0, var_42_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_47_arg_0=0, var_47_arg_1=1, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] EXPR var_47 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_86=0, var_89=0] [L276] EXPR var_86 & mask_SORT_21 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_101_arg_0=0, var_101_arg_1=1, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] EXPR var_101 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] EXPR var_105 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_106=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] EXPR var_106 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_108_arg_0=-1, var_108_arg_1=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113_arg_0=1, var_113_arg_1=-1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] EXPR var_113_arg_0 & var_113_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] EXPR var_113 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1794 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1794 mSDsluCounter, 14017 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11022 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3883 IncrementalHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 2995 mSDtfsCounter, 3883 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=10, InterpolantAutomatonStates: 68, 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, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1272 NumberOfCodeBlocks, 1272 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 4586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 03:01:05,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:01:08,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:01:08,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:01:08,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:01:08,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:01:08,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:01:08,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:01:08,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:01:08,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:01:08,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:01:08,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:01:08,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:01:08,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:01:08,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:01:08,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:01:08,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:01:08,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:01:08,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:01:08,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:01:08,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:01:08,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:01:08,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:01:08,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:01:08,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:01:08,400 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:01:08,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:01:08,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:01:08,401 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:01:08,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:01:08,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:01:08,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:01:08,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:01:08,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:01:08,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:01:08,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:01:08,411 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:01:08,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:01:08,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:01:08,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:01:08,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:01:08,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:01:08,412 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 -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2024-11-10 03:01:08,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:01:08,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:01:08,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:01:08,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:01:08,761 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:01:08,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-10 03:01:10,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:01:10,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:01:10,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-10 03:01:10,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3e8de13/9239346b279844eb998cb45a8c30c69e/FLAG1be13ac59 [2024-11-10 03:01:10,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3e8de13/9239346b279844eb998cb45a8c30c69e [2024-11-10 03:01:10,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:01:10,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:01:10,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:01:10,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:01:10,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:01:10,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:01:10" (1/1) ... [2024-11-10 03:01:10,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cbe3578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:10, skipping insertion in model container [2024-11-10 03:01:10,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:01:10" (1/1) ... [2024-11-10 03:01:10,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:01:11,133 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.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-10 03:01:11,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:01:11,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:01:11,297 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.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-10 03:01:11,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:01:11,413 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:01:11,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11 WrapperNode [2024-11-10 03:01:11,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:01:11,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:01:11,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:01:11,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:01:11,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,489 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 467 [2024-11-10 03:01:11,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:01:11,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:01:11,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:01:11,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:01:11,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,532 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 03:01:11,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:01:11,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:01:11,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:01:11,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:01:11,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (1/1) ... [2024-11-10 03:01:11,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:01:11,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:01:11,598 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 03:01:11,602 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 03:01:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:01:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:01:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:01:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:01:11,802 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:01:11,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:01:12,259 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2024-11-10 03:01:12,259 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:01:12,271 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:01:12,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:01:12,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:01:12 BoogieIcfgContainer [2024-11-10 03:01:12,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:01:12,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:01:12,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:01:12,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:01:12,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:01:10" (1/3) ... [2024-11-10 03:01:12,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee4254e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:01:12, skipping insertion in model container [2024-11-10 03:01:12,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:01:11" (2/3) ... [2024-11-10 03:01:12,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee4254e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:01:12, skipping insertion in model container [2024-11-10 03:01:12,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:01:12" (3/3) ... [2024-11-10 03:01:12,283 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-10 03:01:12,299 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:01:12,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:01:12,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:01:12,377 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;@5ea758c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:01:12,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:01:12,382 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 03:01:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:01:12,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:01:12,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:01:12,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:01:12,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:01:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:01:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:01:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575946472] [2024-11-10 03:01:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:01:12,414 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 03:01:12,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:01:12,418 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 03:01:12,420 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 03:01:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:01:12,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:01:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:01:12,967 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 03:01:12,969 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:01:12,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:01:12,980 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 03:01:13,173 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 03:01:13,177 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-10 03:01:13,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:01:13,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:01:13 BoogieIcfgContainer [2024-11-10 03:01:13,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:01:13,227 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:01:13,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:01:13,229 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:01:13,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:01:12" (3/4) ... [2024-11-10 03:01:13,230 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 03:01:13,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 03:01:13,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:01:13,335 INFO L158 Benchmark]: Toolchain (without parser) took 2465.41ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 30.9MB in the beginning and 51.7MB in the end (delta: -20.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,335 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 24.9MB in the beginning and 24.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:01:13,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.72ms. Allocated memory is still 65.0MB. Free memory was 30.7MB in the beginning and 39.5MB in the end (delta: -8.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.69ms. Allocated memory is still 65.0MB. Free memory was 39.3MB in the beginning and 35.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,336 INFO L158 Benchmark]: Boogie Preprocessor took 69.88ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 31.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,337 INFO L158 Benchmark]: IcfgBuilder took 712.32ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 31.0MB in the beginning and 40.4MB in the end (delta: -9.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,337 INFO L158 Benchmark]: TraceAbstraction took 951.17ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 30.7MB in the end (delta: 9.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,337 INFO L158 Benchmark]: Witness Printer took 107.53ms. Allocated memory is still 81.8MB. Free memory was 30.7MB in the beginning and 51.7MB in the end (delta: -20.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:01:13,339 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.17ms. Allocated memory is still 50.3MB. Free memory was 24.9MB in the beginning and 24.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.72ms. Allocated memory is still 65.0MB. Free memory was 30.7MB in the beginning and 39.5MB in the end (delta: -8.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.69ms. Allocated memory is still 65.0MB. Free memory was 39.3MB in the beginning and 35.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.88ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 31.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 712.32ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 31.0MB in the beginning and 40.4MB in the end (delta: -9.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 951.17ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 30.7MB in the end (delta: 9.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 107.53ms. Allocated memory is still 81.8MB. Free memory was 30.7MB in the beginning and 51.7MB in the end (delta: -20.9MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2024-11-10 03:01:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE