./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.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 c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:56:36,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:56:36,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:56:36,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:56:36,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:56:36,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:56:36,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:56:36,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:56:36,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:56:36,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:56:36,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:56:36,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:56:36,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:56:36,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:56:36,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:56:36,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:56:36,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:56:36,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:56:36,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:56:36,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:56:36,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:56:36,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:56:36,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:56:36,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:56:36,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:56:36,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:56:36,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:56:36,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:56:36,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:56:36,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:56:36,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:56:36,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:56:36,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:56:36,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:56:36,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:56:36,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:56:36,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:56:36,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:56:36,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:56:36,278 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 -> c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 [2024-11-16 10:56:36,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:56:36,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:56:36,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:56:36,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:56:36,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:56:36,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-16 10:56:37,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:56:37,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:56:37,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-16 10:56:37,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fe9fbc2/cbeda7c79ad1463294d5fd0d6f1e6f96/FLAG8e65e3a60 [2024-11-16 10:56:38,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fe9fbc2/cbeda7c79ad1463294d5fd0d6f1e6f96 [2024-11-16 10:56:38,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:56:38,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:56:38,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:56:38,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:56:38,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:56:38,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e07ff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38, skipping insertion in model container [2024-11-16 10:56:38,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:56:38,433 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.eq_sdp_v5.c[1249,1262] [2024-11-16 10:56:38,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:56:38,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:56:38,533 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.eq_sdp_v5.c[1249,1262] [2024-11-16 10:56:38,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:56:38,572 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:56:38,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38 WrapperNode [2024-11-16 10:56:38,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:56:38,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:56:38,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:56:38,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:56:38,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,634 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 415 [2024-11-16 10:56:38,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:56:38,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:56:38,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:56:38,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:56:38,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:56:38,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:56:38,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:56:38,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:56:38,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:56:38,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (1/1) ... [2024-11-16 10:56:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:56:38,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:56:38,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:56:38,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:56:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:56:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:56:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:56:38,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:56:38,848 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:56:38,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:56:39,316 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-16 10:56:39,317 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:56:39,354 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:56:39,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:56:39,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:56:39 BoogieIcfgContainer [2024-11-16 10:56:39,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:56:39,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:56:39,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:56:39,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:56:39,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:56:38" (1/3) ... [2024-11-16 10:56:39,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446facd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:39, skipping insertion in model container [2024-11-16 10:56:39,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:38" (2/3) ... [2024-11-16 10:56:39,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446facd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:39, skipping insertion in model container [2024-11-16 10:56:39,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:56:39" (3/3) ... [2024-11-16 10:56:39,365 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-11-16 10:56:39,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:56:39,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:56:39,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:56:39,449 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;@6b6aad05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:56:39,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:56:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 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-16 10:56:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 10:56:39,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:39,460 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] [2024-11-16 10:56:39,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:39,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2110902522, now seen corresponding path program 1 times [2024-11-16 10:56:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:56:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411170336] [2024-11-16 10:56:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:56:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:56:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:56:39,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-16 10:56:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:56:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411170336] [2024-11-16 10:56:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411170336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:56:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:56:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:56:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394776849] [2024-11-16 10:56:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:56:39,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:56:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:56:39,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:56:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:56:39,962 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 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 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 10:56:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:56:40,052 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions. [2024-11-16 10:56:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:56:40,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-16 10:56:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:56:40,061 INFO L225 Difference]: With dead ends: 145 [2024-11-16 10:56:40,061 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 10:56:40,063 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-16 10:56:40,065 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:56:40,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:56:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 10:56:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 10:56:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 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-16 10:56:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-11-16 10:56:40,094 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 36 [2024-11-16 10:56:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:56:40,095 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-11-16 10:56:40,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 10:56:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-11-16 10:56:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 10:56:40,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:40,097 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] [2024-11-16 10:56:40,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:56:40,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:40,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1158522161, now seen corresponding path program 1 times [2024-11-16 10:56:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:56:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986969544] [2024-11-16 10:56:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:56:40,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:56:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:56:40,220 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-16 10:56:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:56:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986969544] [2024-11-16 10:56:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986969544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:56:40,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:56:40,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:56:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015332023] [2024-11-16 10:56:40,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:56:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:56:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:56:40,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:56:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:56:40,226 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-16 10:56:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:56:40,302 INFO L93 Difference]: Finished difference Result 144 states and 207 transitions. [2024-11-16 10:56:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:56:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-16 10:56:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:56:40,304 INFO L225 Difference]: With dead ends: 144 [2024-11-16 10:56:40,304 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 10:56:40,304 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-16 10:56:40,305 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:56:40,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:56:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 10:56:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 10:56:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 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-16 10:56:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-16 10:56:40,314 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 37 [2024-11-16 10:56:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:56:40,314 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-16 10:56:40,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-16 10:56:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-16 10:56:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 10:56:40,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:40,316 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] [2024-11-16 10:56:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:56:40,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1301692223, now seen corresponding path program 1 times [2024-11-16 10:56:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:56:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854051357] [2024-11-16 10:56:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:56:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:56:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:56:40,519 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-16 10:56:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:56:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854051357] [2024-11-16 10:56:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854051357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:56:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:56:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:56:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688687941] [2024-11-16 10:56:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:56:40,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:56:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:56:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:56:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:56:40,523 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-16 10:56:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:56:40,589 INFO L93 Difference]: Finished difference Result 144 states and 206 transitions. [2024-11-16 10:56:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:56:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2024-11-16 10:56:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:56:40,591 INFO L225 Difference]: With dead ends: 144 [2024-11-16 10:56:40,592 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 10:56:40,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:56:40,593 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 105 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:56:40,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 211 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:56:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 10:56:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 10:56:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 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-16 10:56:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-16 10:56:40,600 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 38 [2024-11-16 10:56:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:56:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-16 10:56:40,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-16 10:56:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-16 10:56:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 10:56:40,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:40,602 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] [2024-11-16 10:56:40,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:56:40,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:40,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1484682534, now seen corresponding path program 1 times [2024-11-16 10:56:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:56:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092111810] [2024-11-16 10:56:40,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:56:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:56:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:56:40,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:56:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:56:40,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 10:56:40,668 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:56:40,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:56:40,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:56:40,673 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 10:56:40,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:56:40,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:56:40 BoogieIcfgContainer [2024-11-16 10:56:40,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:56:40,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:56:40,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:56:40,710 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:56:40,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:56:39" (3/4) ... [2024-11-16 10:56:40,712 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 10:56:40,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:56:40,714 INFO L158 Benchmark]: Toolchain (without parser) took 2434.50ms. Allocated memory is still 190.8MB. Free memory was 120.4MB in the beginning and 104.7MB in the end (delta: 15.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-16 10:56:40,714 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:56:40,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.56ms. Allocated memory is still 190.8MB. Free memory was 120.2MB in the beginning and 157.5MB in the end (delta: -37.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-16 10:56:40,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.60ms. Allocated memory is still 190.8MB. Free memory was 157.5MB in the beginning and 148.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 10:56:40,717 INFO L158 Benchmark]: Boogie Preprocessor took 62.23ms. Allocated memory is still 190.8MB. Free memory was 148.4MB in the beginning and 142.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 10:56:40,718 INFO L158 Benchmark]: IcfgBuilder took 656.60ms. Allocated memory is still 190.8MB. Free memory was 142.8MB in the beginning and 87.6MB in the end (delta: 55.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-16 10:56:40,718 INFO L158 Benchmark]: TraceAbstraction took 1349.61ms. Allocated memory is still 190.8MB. Free memory was 86.9MB in the beginning and 104.7MB in the end (delta: -17.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:56:40,718 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 190.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:56:40,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.56ms. Allocated memory is still 190.8MB. Free memory was 120.2MB in the beginning and 157.5MB in the end (delta: -37.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.60ms. Allocated memory is still 190.8MB. Free memory was 157.5MB in the beginning and 148.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.23ms. Allocated memory is still 190.8MB. Free memory was 148.4MB in the beginning and 142.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 656.60ms. Allocated memory is still 190.8MB. Free memory was 142.8MB in the beginning and 87.6MB in the end (delta: 55.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1349.61ms. Allocated memory is still 190.8MB. Free memory was 86.9MB in the beginning and 104.7MB in the end (delta: -17.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 190.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 99. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_19_arg_0=1, var_19_arg_1=-2, var_29=0, var_75=1, var_9=0] [L99] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] EXPR var_19 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 864 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 536 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 328 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-16 10:56:40,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.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 c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:56:42,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:56:42,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 10:56:42,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:56:42,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:56:42,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:56:42,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:56:42,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:56:42,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:56:42,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:56:42,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:56:42,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:56:42,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:56:42,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:56:42,560 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:56:42,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:56:42,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:56:42,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:56:42,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:56:42,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:56:42,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:56:42,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 10:56:42,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 10:56:42,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:56:42,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 10:56:42,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:56:42,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:56:42,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:56:42,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:56:42,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:56:42,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:56:42,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:56:42,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:56:42,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:56:42,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:56:42,568 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 10:56:42,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 10:56:42,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:56:42,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:56:42,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:56:42,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:56:42,570 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 -> c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 [2024-11-16 10:56:42,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:56:42,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:56:42,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:56:42,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:56:42,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:56:42,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-16 10:56:44,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:56:44,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:56:44,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-11-16 10:56:44,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6b81be0/12bd42b7adfd4c339ed8cb40ad8cdba9/FLAG9c8e100c9 [2024-11-16 10:56:44,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c6b81be0/12bd42b7adfd4c339ed8cb40ad8cdba9 [2024-11-16 10:56:44,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:56:44,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:56:44,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:56:44,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:56:44,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:56:44,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:44,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a45a6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44, skipping insertion in model container [2024-11-16 10:56:44,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:44,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:56:44,850 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.eq_sdp_v5.c[1249,1262] [2024-11-16 10:56:44,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:56:44,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:56:44,932 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.eq_sdp_v5.c[1249,1262] [2024-11-16 10:56:44,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:56:44,985 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:56:44,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44 WrapperNode [2024-11-16 10:56:44,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:56:44,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:56:44,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:56:44,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:56:44,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,033 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 247 [2024-11-16 10:56:45,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:56:45,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:56:45,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:56:45,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:56:45,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,071 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:56:45,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:56:45,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:56:45,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:56:45,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:56:45,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (1/1) ... [2024-11-16 10:56:45,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:56:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:56:45,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:56:45,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:56:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:56:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 10:56:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:56:45,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:56:45,239 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:56:45,241 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:56:45,493 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-16 10:56:45,494 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:56:45,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:56:45,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:56:45,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:56:45 BoogieIcfgContainer [2024-11-16 10:56:45,506 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:56:45,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:56:45,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:56:45,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:56:45,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:56:44" (1/3) ... [2024-11-16 10:56:45,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33faa16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:45, skipping insertion in model container [2024-11-16 10:56:45,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:44" (2/3) ... [2024-11-16 10:56:45,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33faa16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:45, skipping insertion in model container [2024-11-16 10:56:45,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:56:45" (3/3) ... [2024-11-16 10:56:45,513 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-11-16 10:56:45,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:56:45,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:56:45,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:56:45,579 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;@74a3e418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:56:45,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:56:45,583 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-16 10:56:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 10:56:45,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:45,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 10:56:45,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 10:56:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:56:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832839828] [2024-11-16 10:56:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:56:45,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:56:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:56:45,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:56:45,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 10:56:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:56:45,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 10:56:45,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:56:45,830 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-16 10:56:45,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:56:45,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:56:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832839828] [2024-11-16 10:56:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832839828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:56:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:56:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:56:45,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915744755] [2024-11-16 10:56:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:56:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:56:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:56:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:56:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:56:45,856 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:56:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:56:45,882 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-16 10:56:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:56:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 10:56:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:56:45,901 INFO L225 Difference]: With dead ends: 21 [2024-11-16 10:56:45,901 INFO L226 Difference]: Without dead ends: 10 [2024-11-16 10:56:45,903 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-16 10:56:45,906 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:56:45,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:56:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-16 10:56:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-16 10:56:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:56:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 10:56:45,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 10:56:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:56:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 10:56:45,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:56:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 10:56:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 10:56:45,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:45,930 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:56:45,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 10:56:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:56:46,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 10:56:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:56:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391331276] [2024-11-16 10:56:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:56:46,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:56:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:56:46,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:56:46,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 10:56:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:56:46,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 10:56:46,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:56:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:56:46,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:56:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:56:49,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:56:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391331276] [2024-11-16 10:56:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391331276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:56:49,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:56:49,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 10:56:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54762782] [2024-11-16 10:56:49,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:56:49,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:56:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:56:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:56:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:56:49,451 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-16 10:56:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:56:49,752 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 10:56:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:56:49,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 9 [2024-11-16 10:56:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:56:49,753 INFO L225 Difference]: With dead ends: 16 [2024-11-16 10:56:49,753 INFO L226 Difference]: Without dead ends: 13 [2024-11-16 10:56:49,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:56:49,754 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:56:49,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:56:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-16 10:56:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-16 10:56:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-16 10:56:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 10:56:49,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 10:56:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:56:49,757 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 10:56:49,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-16 10:56:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 10:56:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 10:56:49,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:56:49,758 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 10:56:49,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 10:56:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:56:49,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:56:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:56:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 10:56:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:56:49,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71140361] [2024-11-16 10:56:49,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:56:49,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:56:49,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:56:49,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:56:49,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 10:56:50,061 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:56:50,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:56:50,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 10:56:50,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:56:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:56:51,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:57:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:57:11,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:57:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71140361] [2024-11-16 10:57:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71140361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:57:11,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:57:11,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-16 10:57:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15928570] [2024-11-16 10:57:11,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:57:11,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 10:57:11,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:57:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 10:57:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2024-11-16 10:57:11,982 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-16 10:57:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:57:25,702 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-16 10:57:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 10:57:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 12 [2024-11-16 10:57:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:57:25,703 INFO L225 Difference]: With dead ends: 19 [2024-11-16 10:57:25,703 INFO L226 Difference]: Without dead ends: 16 [2024-11-16 10:57:25,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=59, Invalid=149, Unknown=2, NotChecked=0, Total=210 [2024-11-16 10:57:25,704 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:57:25,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 10:57:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-16 10:57:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-16 10:57:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-16 10:57:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 10:57:25,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-11-16 10:57:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:57:25,708 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 10:57:25,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-16 10:57:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 10:57:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 10:57:25,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:57:25,708 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 10:57:25,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 10:57:25,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:57:25,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:57:25,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:57:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 3 times [2024-11-16 10:57:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:57:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446454978] [2024-11-16 10:57:25,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 10:57:25,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:57:25,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:57:25,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:57:25,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 10:57:26,028 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-16 10:57:26,029 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 10:57:26,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:57:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:57:26,239 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 10:57:26,239 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:57:26,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:57:26,248 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 (5)] Ended with exit code 0 [2024-11-16 10:57:26,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:57:26,448 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-16 10:57:26,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:57:26,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:57:26 BoogieIcfgContainer [2024-11-16 10:57:26,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:57:26,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:57:26,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:57:26,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:57:26,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:56:45" (3/4) ... [2024-11-16 10:57:26,496 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 10:57:26,571 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 10:57:26,572 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:57:26,572 INFO L158 Benchmark]: Toolchain (without parser) took 41887.94ms. Allocated memory was 69.2MB in the beginning and 111.1MB in the end (delta: 41.9MB). Free memory was 48.7MB in the beginning and 34.0MB in the end (delta: 14.7MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,572 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 69.2MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:57:26,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.87ms. Allocated memory is still 69.2MB. Free memory was 48.5MB in the beginning and 31.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.92ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 30.8MB in the beginning and 71.6MB in the end (delta: -40.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,573 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 92.3MB. Free memory was 71.6MB in the beginning and 68.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,573 INFO L158 Benchmark]: IcfgBuilder took 417.78ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 68.9MB in the end (delta: -749.7kB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,574 INFO L158 Benchmark]: TraceAbstraction took 40986.49ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 68.8MB in the beginning and 43.4MB in the end (delta: 25.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,575 INFO L158 Benchmark]: Witness Printer took 76.85ms. Allocated memory is still 111.1MB. Free memory was 43.4MB in the beginning and 34.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 10:57:26,576 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 69.2MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.87ms. Allocated memory is still 69.2MB. Free memory was 48.5MB in the beginning and 31.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.92ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 30.8MB in the beginning and 71.6MB in the end (delta: -40.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 92.3MB. Free memory was 71.6MB in the beginning and 68.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 417.78ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 68.9MB in the end (delta: -749.7kB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40986.49ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 68.8MB in the beginning and 43.4MB in the end (delta: 25.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 76.85ms. Allocated memory is still 111.1MB. Free memory was 43.4MB in the beginning and 34.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_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: 40.9s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 16 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 29.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 43 ConstructedInterpolants, 14 QuantifiedInterpolants, 1891 SizeOfPredicates, 16 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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-16 10:57:26,794 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-16 10:57:26,999 FATAL L548 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Could not destroy process within 200 ms, abandoning it 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