./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.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 2164f122c5c32edee2ede3aaa086ed34ce5834fc0fb4a31a890516c48b14c747 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:03:22,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:03:22,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 03:03:22,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:03:22,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:03:22,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:03:22,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:03:22,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:03:22,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:03:22,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:03:22,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:03:22,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:03:22,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:03:22,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:03:22,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:03:22,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:03:22,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:03:22,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:03:22,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:03:22,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:03:22,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:03:22,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:03:22,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:03:22,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:03:22,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:03:22,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:03:22,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:03:22,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:03:22,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:03:22,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:03:22,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:03:22,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:03:22,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:03:22,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:03:22,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:03:22,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:03:22,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:03:22,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:03:22,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:03:22,510 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 -> 2164f122c5c32edee2ede3aaa086ed34ce5834fc0fb4a31a890516c48b14c747 [2024-11-10 03:03:22,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:03:22,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:03:22,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:03:22,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:03:22,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:03:22,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c [2024-11-10 03:03:24,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:03:24,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:03:24,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c [2024-11-10 03:03:24,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96ed0b99/cc6a7ecab5174c0d8ce90b160ad3891a/FLAG72019fc22 [2024-11-10 03:03:24,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96ed0b99/cc6a7ecab5174c0d8ce90b160ad3891a [2024-11-10 03:03:24,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:03:24,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:03:24,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:03:24,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:03:24,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:03:24,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:24" (1/1) ... [2024-11-10 03:03:24,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74df4b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:24, skipping insertion in model container [2024-11-10 03:03:24,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:24" (1/1) ... [2024-11-10 03:03:24,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:03:24,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c[1260,1273] [2024-11-10 03:03:25,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:03:25,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:03:25,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c[1260,1273] [2024-11-10 03:03:25,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:03:25,535 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:03:25,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25 WrapperNode [2024-11-10 03:03:25,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:03:25,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:03:25,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:03:25,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:03:25,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:25,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,173 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4506 [2024-11-10 03:03:26,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:03:26,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:03:26,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:03:26,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:03:26,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,504 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:03:26,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:03:26,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:03:26,824 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:03:26,824 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:03:26,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (1/1) ... [2024-11-10 03:03:26,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:03:26,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:03:26,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:03:26,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:03:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:03:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:03:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:03:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:03:27,345 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:03:27,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:03:31,570 INFO L? ?]: Removed 2675 outVars from TransFormulas that were not future-live. [2024-11-10 03:03:31,570 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:03:31,776 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:03:31,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:03:31,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:31 BoogieIcfgContainer [2024-11-10 03:03:31,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:03:31,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:03:31,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:03:31,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:03:31,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:03:24" (1/3) ... [2024-11-10 03:03:31,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e64c934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:03:31, skipping insertion in model container [2024-11-10 03:03:31,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:25" (2/3) ... [2024-11-10 03:03:31,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e64c934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:03:31, skipping insertion in model container [2024-11-10 03:03:31,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:31" (3/3) ... [2024-11-10 03:03:31,786 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p4.c [2024-11-10 03:03:31,803 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:03:31,803 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:03:31,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:03:31,913 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;@4b35024f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:03:31,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:03:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 1354 states, 1352 states have (on average 1.4985207100591715) internal successors, (2026), 1353 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 03:03:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:31,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:31,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:31,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 577650150, now seen corresponding path program 1 times [2024-11-10 03:03:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:31,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087599613] [2024-11-10 03:03:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:32,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087599613] [2024-11-10 03:03:32,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087599613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:32,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:32,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:03:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461515613] [2024-11-10 03:03:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:32,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:03:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:03:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:32,707 INFO L87 Difference]: Start difference. First operand has 1354 states, 1352 states have (on average 1.4985207100591715) internal successors, (2026), 1353 states have internal predecessors, (2026), 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 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:33,548 INFO L93 Difference]: Finished difference Result 2651 states and 3971 transitions. [2024-11-10 03:03:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:03:33,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-11-10 03:03:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:33,576 INFO L225 Difference]: With dead ends: 2651 [2024-11-10 03:03:33,576 INFO L226 Difference]: Without dead ends: 1351 [2024-11-10 03:03:33,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:33,586 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 0 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5044 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:33,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5044 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:03:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-10 03:03:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2024-11-10 03:03:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.4977777777777779) internal successors, (2022), 1350 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2022 transitions. [2024-11-10 03:03:33,690 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2022 transitions. Word has length 46 [2024-11-10 03:03:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:33,690 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2022 transitions. [2024-11-10 03:03:33,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2022 transitions. [2024-11-10 03:03:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 03:03:33,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:33,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:33,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:03:33,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 872341050, now seen corresponding path program 1 times [2024-11-10 03:03:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:33,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654109446] [2024-11-10 03:03:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:33,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654109446] [2024-11-10 03:03:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654109446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:33,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:33,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:03:33,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729994938] [2024-11-10 03:03:33,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:33,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:03:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:03:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:33,887 INFO L87 Difference]: Start difference. First operand 1351 states and 2022 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:34,582 INFO L93 Difference]: Finished difference Result 2650 states and 3967 transitions. [2024-11-10 03:03:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:03:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-10 03:03:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:34,589 INFO L225 Difference]: With dead ends: 2650 [2024-11-10 03:03:34,590 INFO L226 Difference]: Without dead ends: 1353 [2024-11-10 03:03:34,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:34,595 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 0 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:34,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5041 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:03:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-10 03:03:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-10 03:03:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1352 states have (on average 1.4970414201183433) internal successors, (2024), 1352 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2024 transitions. [2024-11-10 03:03:34,625 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2024 transitions. Word has length 47 [2024-11-10 03:03:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:34,626 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 2024 transitions. [2024-11-10 03:03:34,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2024 transitions. [2024-11-10 03:03:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 03:03:34,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:34,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:34,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:03:34,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:34,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1020014539, now seen corresponding path program 1 times [2024-11-10 03:03:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:34,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758125235] [2024-11-10 03:03:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758125235] [2024-11-10 03:03:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758125235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:35,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:35,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:03:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112812389] [2024-11-10 03:03:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:35,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:03:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:03:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:35,224 INFO L87 Difference]: Start difference. First operand 1353 states and 2024 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:36,517 INFO L93 Difference]: Finished difference Result 2660 states and 3980 transitions. [2024-11-10 03:03:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:03:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 48 [2024-11-10 03:03:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:36,523 INFO L225 Difference]: With dead ends: 2660 [2024-11-10 03:03:36,523 INFO L226 Difference]: Without dead ends: 1361 [2024-11-10 03:03:36,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:03:36,528 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1995 mSDsluCounter, 8342 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 10013 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:36,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 10013 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 03:03:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-10 03:03:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2024-11-10 03:03:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.4959469417833455) internal successors, (2030), 1357 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2030 transitions. [2024-11-10 03:03:36,561 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2030 transitions. Word has length 48 [2024-11-10 03:03:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:36,562 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2030 transitions. [2024-11-10 03:03:36,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2030 transitions. [2024-11-10 03:03:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 03:03:36,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:36,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:36,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:03:36,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:36,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1223187824, now seen corresponding path program 1 times [2024-11-10 03:03:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288120489] [2024-11-10 03:03:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:37,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288120489] [2024-11-10 03:03:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288120489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:03:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296346740] [2024-11-10 03:03:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:37,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:03:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:03:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:37,086 INFO L87 Difference]: Start difference. First operand 1358 states and 2030 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:38,344 INFO L93 Difference]: Finished difference Result 2670 states and 3992 transitions. [2024-11-10 03:03:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:03:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 49 [2024-11-10 03:03:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:38,350 INFO L225 Difference]: With dead ends: 2670 [2024-11-10 03:03:38,350 INFO L226 Difference]: Without dead ends: 1366 [2024-11-10 03:03:38,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:03:38,353 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1986 mSDsluCounter, 8371 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 10050 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:38,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 10050 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 03:03:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2024-11-10 03:03:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1358. [2024-11-10 03:03:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.4959469417833455) internal successors, (2030), 1357 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2030 transitions. [2024-11-10 03:03:38,382 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2030 transitions. Word has length 49 [2024-11-10 03:03:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:38,382 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2030 transitions. [2024-11-10 03:03:38,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2030 transitions. [2024-11-10 03:03:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 03:03:38,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:38,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:38,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:03:38,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:38,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2084434050, now seen corresponding path program 1 times [2024-11-10 03:03:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909094264] [2024-11-10 03:03:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:38,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909094264] [2024-11-10 03:03:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909094264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:38,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:38,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:03:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538385349] [2024-11-10 03:03:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:38,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:03:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:03:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:38,971 INFO L87 Difference]: Start difference. First operand 1358 states and 2030 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:40,390 INFO L93 Difference]: Finished difference Result 2668 states and 3988 transitions. [2024-11-10 03:03:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:03:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 49 [2024-11-10 03:03:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:40,395 INFO L225 Difference]: With dead ends: 2668 [2024-11-10 03:03:40,395 INFO L226 Difference]: Without dead ends: 1362 [2024-11-10 03:03:40,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:40,398 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 10 mSDsluCounter, 10026 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11701 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:40,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11701 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 03:03:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-10 03:03:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1360. [2024-11-10 03:03:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.4952170713760118) internal successors, (2032), 1359 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2032 transitions. [2024-11-10 03:03:40,422 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2032 transitions. Word has length 49 [2024-11-10 03:03:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:40,423 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2032 transitions. [2024-11-10 03:03:40,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2032 transitions. [2024-11-10 03:03:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 03:03:40,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:40,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:40,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:03:40,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:40,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash -34622763, now seen corresponding path program 1 times [2024-11-10 03:03:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967776482] [2024-11-10 03:03:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967776482] [2024-11-10 03:03:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967776482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:03:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31649128] [2024-11-10 03:03:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:40,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:03:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:03:40,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:03:40,822 INFO L87 Difference]: Start difference. First operand 1360 states and 2032 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:41,903 INFO L93 Difference]: Finished difference Result 2815 states and 4202 transitions. [2024-11-10 03:03:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:03:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 49 [2024-11-10 03:03:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:41,909 INFO L225 Difference]: With dead ends: 2815 [2024-11-10 03:03:41,910 INFO L226 Difference]: Without dead ends: 1509 [2024-11-10 03:03:41,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:03:41,913 INFO L432 NwaCegarLoop]: 1668 mSDtfsCounter, 2413 mSDsluCounter, 6666 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 8334 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:41,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 8334 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 03:03:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-10 03:03:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1378. [2024-11-10 03:03:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1377 states have (on average 1.4938271604938271) internal successors, (2057), 1377 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2057 transitions. [2024-11-10 03:03:41,938 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2057 transitions. Word has length 49 [2024-11-10 03:03:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:41,938 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2057 transitions. [2024-11-10 03:03:41,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2057 transitions. [2024-11-10 03:03:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 03:03:41,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:41,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:41,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:03:41,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:41,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash 317751973, now seen corresponding path program 1 times [2024-11-10 03:03:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810031407] [2024-11-10 03:03:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810031407] [2024-11-10 03:03:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810031407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:42,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:42,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:03:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507422389] [2024-11-10 03:03:42,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:42,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:03:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:03:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:42,473 INFO L87 Difference]: Start difference. First operand 1378 states and 2057 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:43,754 INFO L93 Difference]: Finished difference Result 2688 states and 4015 transitions. [2024-11-10 03:03:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:03:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 50 [2024-11-10 03:03:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:43,759 INFO L225 Difference]: With dead ends: 2688 [2024-11-10 03:03:43,760 INFO L226 Difference]: Without dead ends: 1382 [2024-11-10 03:03:43,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:03:43,763 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1983 mSDsluCounter, 8343 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 10014 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:43,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 10014 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 03:03:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-10 03:03:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1376. [2024-11-10 03:03:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1375 states have (on average 1.4938181818181817) internal successors, (2054), 1375 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2054 transitions. [2024-11-10 03:03:43,789 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2054 transitions. Word has length 50 [2024-11-10 03:03:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:43,790 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2054 transitions. [2024-11-10 03:03:43,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2054 transitions. [2024-11-10 03:03:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 03:03:43,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:43,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:43,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:03:43,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1155118316, now seen corresponding path program 1 times [2024-11-10 03:03:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793481116] [2024-11-10 03:03:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:03:43,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:03:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:03:43,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:03:43,966 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:03:43,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:03:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:03:43,973 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:44,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:03:44,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:03:44 BoogieIcfgContainer [2024-11-10 03:03:44,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:03:44,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:03:44,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:03:44,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:03:44,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:31" (3/4) ... [2024-11-10 03:03:44,069 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:03:44,071 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:03:44,072 INFO L158 Benchmark]: Toolchain (without parser) took 19459.52ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 109.5MB in the beginning and 686.8MB in the end (delta: -577.3MB). Peak memory consumption was 418.2MB. Max. memory is 16.1GB. [2024-11-10 03:03:44,072 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:03:44,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 921.90ms. Allocated memory is still 155.2MB. Free memory was 109.0MB in the beginning and 75.8MB in the end (delta: 33.2MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-11-10 03:03:44,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 637.30ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 75.8MB in the beginning and 148.9MB in the end (delta: -73.1MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2024-11-10 03:03:44,073 INFO L158 Benchmark]: Boogie Preprocessor took 647.35ms. Allocated memory is still 264.2MB. Free memory was 148.9MB in the beginning and 103.0MB in the end (delta: 45.9MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-11-10 03:03:44,074 INFO L158 Benchmark]: IcfgBuilder took 4953.84ms. Allocated memory was 264.2MB in the beginning and 765.5MB in the end (delta: 501.2MB). Free memory was 103.0MB in the beginning and 454.0MB in the end (delta: -351.0MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. [2024-11-10 03:03:44,074 INFO L158 Benchmark]: TraceAbstraction took 12285.94ms. Allocated memory was 765.5MB in the beginning and 1.2GB in the end (delta: 385.9MB). Free memory was 454.0MB in the beginning and 686.8MB in the end (delta: -232.8MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. [2024-11-10 03:03:44,074 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 1.2GB. Free memory is still 686.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:03:44,076 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.14ms. Allocated memory is still 109.1MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 921.90ms. Allocated memory is still 155.2MB. Free memory was 109.0MB in the beginning and 75.8MB in the end (delta: 33.2MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 637.30ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 75.8MB in the beginning and 148.9MB in the end (delta: -73.1MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 647.35ms. Allocated memory is still 264.2MB. Free memory was 148.9MB in the beginning and 103.0MB in the end (delta: 45.9MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * IcfgBuilder took 4953.84ms. Allocated memory was 264.2MB in the beginning and 765.5MB in the end (delta: 501.2MB). Free memory was 103.0MB in the beginning and 454.0MB in the end (delta: -351.0MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12285.94ms. Allocated memory was 765.5MB in the beginning and 1.2GB in the end (delta: 385.9MB). Free memory was 454.0MB in the beginning and 686.8MB in the end (delta: -232.8MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 1.2GB. Free memory is still 686.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 206. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 2); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (2 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 3); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (3 - 1); [L38] const SORT_41 mask_SORT_41 = (SORT_41)-1 >> (sizeof(SORT_41) * 8 - 12); [L39] const SORT_41 msb_SORT_41 = (SORT_41)1 << (12 - 1); [L41] const SORT_97 mask_SORT_97 = (SORT_97)-1 >> (sizeof(SORT_97) * 8 - 17); [L42] const SORT_97 msb_SORT_97 = (SORT_97)1 << (17 - 1); [L44] const SORT_98 mask_SORT_98 = (SORT_98)-1 >> (sizeof(SORT_98) * 8 - 5); [L45] const SORT_98 msb_SORT_98 = (SORT_98)1 << (5 - 1); [L47] const SORT_101 mask_SORT_101 = (SORT_101)-1 >> (sizeof(SORT_101) * 8 - 9); [L48] const SORT_101 msb_SORT_101 = (SORT_101)1 << (9 - 1); [L50] const SORT_103 mask_SORT_103 = (SORT_103)-1 >> (sizeof(SORT_103) * 8 - 10); [L51] const SORT_103 msb_SORT_103 = (SORT_103)1 << (10 - 1); [L53] const SORT_106 mask_SORT_106 = (SORT_106)-1 >> (sizeof(SORT_106) * 8 - 11); [L54] const SORT_106 msb_SORT_106 = (SORT_106)1 << (11 - 1); [L56] const SORT_111 mask_SORT_111 = (SORT_111)-1 >> (sizeof(SORT_111) * 8 - 13); [L57] const SORT_111 msb_SORT_111 = (SORT_111)1 << (13 - 1); [L59] const SORT_114 mask_SORT_114 = (SORT_114)-1 >> (sizeof(SORT_114) * 8 - 14); [L60] const SORT_114 msb_SORT_114 = (SORT_114)1 << (14 - 1); [L62] const SORT_117 mask_SORT_117 = (SORT_117)-1 >> (sizeof(SORT_117) * 8 - 15); [L63] const SORT_117 msb_SORT_117 = (SORT_117)1 << (15 - 1); [L65] const SORT_150 mask_SORT_150 = (SORT_150)-1 >> (sizeof(SORT_150) * 8 - 7); [L66] const SORT_150 msb_SORT_150 = (SORT_150)1 << (7 - 1); [L68] const SORT_366 mask_SORT_366 = (SORT_366)-1 >> (sizeof(SORT_366) * 8 - 4); [L69] const SORT_366 msb_SORT_366 = (SORT_366)1 << (4 - 1); [L71] const SORT_369 mask_SORT_369 = (SORT_369)-1 >> (sizeof(SORT_369) * 8 - 6); [L72] const SORT_369 msb_SORT_369 = (SORT_369)1 << (6 - 1); [L74] const SORT_372 mask_SORT_372 = (SORT_372)-1 >> (sizeof(SORT_372) * 8 - 8); [L75] const SORT_372 msb_SORT_372 = (SORT_372)1 << (8 - 1); [L77] const SORT_3 var_6 = 0; [L78] const SORT_14 var_15 = 0; [L79] const SORT_9 var_19 = 0; [L80] const SORT_1 var_30 = 1; [L81] const SORT_1 var_36 = 0; [L82] const SORT_41 var_42 = 0; [L83] const SORT_14 var_56 = 2; [L84] const SORT_14 var_60 = 1; [L85] const SORT_14 var_65 = 4; [L86] const SORT_14 var_67 = 5; [L87] const SORT_14 var_71 = 3; [L88] const SORT_98 var_99 = 0; [L89] const SORT_150 var_152 = 5; [L90] const SORT_150 var_156 = 4; [L91] const SORT_150 var_160 = 3; [L92] const SORT_150 var_164 = 2; [L93] const SORT_150 var_168 = 1; [L94] const SORT_150 var_172 = 0; [L95] const SORT_41 var_195 = 2; [L96] const SORT_3 var_217 = 65535; [L98] SORT_1 input_2; [L99] SORT_3 input_4; [L100] SORT_3 input_5; [L101] SORT_3 input_207; [L102] SORT_3 input_208; [L103] SORT_3 input_209; [L104] SORT_3 input_216; [L105] SORT_3 input_224; [L106] SORT_3 input_225; [L107] SORT_3 input_226; [L108] SORT_3 input_229; [L109] SORT_3 input_247; [L110] SORT_3 input_248; [L111] SORT_3 input_249; [L112] SORT_3 input_252; [L113] SORT_3 input_254; [L114] SORT_9 input_268; [L115] SORT_9 input_269; [L116] SORT_9 input_270; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L118] SORT_3 state_7 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_14 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L119] SORT_14 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_14; [L120] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L120] SORT_3 state_21 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L121] SORT_3 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L122] SORT_3 state_34 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L123] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L124] SORT_3 state_39 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_ushort() & mask_SORT_41 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L125] SORT_41 state_43 = __VERIFIER_nondet_ushort() & mask_SORT_41; [L126] EXPR __VERIFIER_nondet_ushort() & mask_SORT_41 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L126] SORT_41 state_45 = __VERIFIER_nondet_ushort() & mask_SORT_41; [L127] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L127] SORT_3 state_47 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L128] SORT_3 state_49 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L129] SORT_3 state_51 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_42=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L130] SORT_3 state_53 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L132] SORT_3 init_8_arg_1 = var_6; [L133] state_7 = init_8_arg_1 [L134] SORT_14 init_17_arg_1 = var_15; [L135] state_16 = init_17_arg_1 [L136] SORT_3 init_22_arg_1 = var_6; [L137] state_21 = init_22_arg_1 [L138] SORT_3 init_24_arg_1 = var_6; [L139] state_23 = init_24_arg_1 [L140] SORT_3 init_35_arg_1 = var_6; [L141] state_34 = init_35_arg_1 [L142] SORT_1 init_38_arg_1 = var_36; [L143] state_37 = init_38_arg_1 [L144] SORT_3 init_40_arg_1 = var_6; [L145] state_39 = init_40_arg_1 [L146] SORT_41 init_44_arg_1 = var_42; [L147] state_43 = init_44_arg_1 [L148] SORT_41 init_46_arg_1 = var_42; [L149] state_45 = init_46_arg_1 [L150] SORT_3 init_48_arg_1 = var_6; [L151] state_47 = init_48_arg_1 [L152] SORT_3 init_50_arg_1 = var_6; [L153] state_49 = init_50_arg_1 [L154] SORT_3 init_52_arg_1 = var_6; [L155] state_51 = init_52_arg_1 [L156] SORT_3 init_54_arg_1 = var_6; [L157] state_53 = init_54_arg_1 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L160] input_2 = __VERIFIER_nondet_uchar() [L161] input_4 = __VERIFIER_nondet_ushort() [L162] input_5 = __VERIFIER_nondet_ushort() [L163] input_207 = __VERIFIER_nondet_ushort() [L164] input_208 = __VERIFIER_nondet_ushort() [L165] input_209 = __VERIFIER_nondet_ushort() [L166] input_216 = __VERIFIER_nondet_ushort() [L167] input_224 = __VERIFIER_nondet_ushort() [L168] input_225 = __VERIFIER_nondet_ushort() [L169] input_226 = __VERIFIER_nondet_ushort() [L170] input_229 = __VERIFIER_nondet_ushort() [L171] input_247 = __VERIFIER_nondet_ushort() [L172] input_248 = __VERIFIER_nondet_ushort() [L173] input_249 = __VERIFIER_nondet_ushort() [L174] input_252 = __VERIFIER_nondet_ushort() [L175] input_254 = __VERIFIER_nondet_ushort() [L176] input_268 = __VERIFIER_nondet_uchar() [L177] input_269 = __VERIFIER_nondet_uchar() [L178] input_270 = __VERIFIER_nondet_uchar() [L181] SORT_3 var_10_arg_0 = state_7; [L182] SORT_9 var_10 = var_10_arg_0 >> 3; VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_10=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L183] EXPR var_10 & mask_SORT_9 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L183] var_10 = var_10 & mask_SORT_9 [L184] SORT_3 var_11_arg_0 = state_7; [L185] SORT_9 var_11 = var_11_arg_0 >> 5; VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_10=0, var_11=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L186] EXPR var_11 & mask_SORT_9 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_10=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L186] var_11 = var_11 & mask_SORT_9 [L187] SORT_9 var_12_arg_0 = var_10; [L188] SORT_9 var_12_arg_1 = var_11; [L189] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L190] SORT_1 var_13_arg_0 = var_12; [L191] SORT_1 var_13 = ~var_13_arg_0; [L192] SORT_14 var_18_arg_0 = state_16; [L193] SORT_9 var_18 = var_18_arg_0 >> 1; VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_13=-2, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_18=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L194] EXPR var_18 & mask_SORT_9 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_13=-2, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L194] var_18 = var_18 & mask_SORT_9 [L195] SORT_9 var_20_arg_0 = var_18; [L196] SORT_9 var_20_arg_1 = var_19; [L197] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L198] SORT_3 var_25_arg_0 = state_21; [L199] SORT_3 var_25_arg_1 = state_23; [L200] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L201] SORT_1 var_26_arg_0 = var_20; [L202] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_13=-2, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_26_arg_0=1, var_26_arg_1=1, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L203] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_13=-2, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L203] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L204] SORT_1 var_27_arg_0 = var_13; [L205] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_27_arg_0=-2, var_27_arg_1=1, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L206] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L206] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L207] SORT_1 var_31_arg_0 = var_27; [L208] SORT_1 var_31 = ~var_31_arg_0; [L209] SORT_1 var_32_arg_0 = var_30; [L210] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_32_arg_0=1, var_32_arg_1=-255, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L211] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L211] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L212] EXPR var_32 & mask_SORT_1 VAL [mask_SORT_101=511, mask_SORT_103=1023, mask_SORT_106=2047, mask_SORT_111=8191, mask_SORT_114=16383, mask_SORT_117=32767, mask_SORT_14=7, mask_SORT_150=127, mask_SORT_1=1, mask_SORT_366=15, mask_SORT_369=63, mask_SORT_372=255, mask_SORT_3=65535, mask_SORT_41=4095, mask_SORT_98=31, mask_SORT_9=3, state_16=0, state_21=0, state_23=0, state_34=0, state_37=0, state_39=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_7=0, var_11=0, var_152=5, var_156=4, var_15=0, var_160=3, var_164=2, var_168=1, var_172=0, var_195=2, var_19=0, var_217=65535, var_30=1, var_36=0, var_56=2, var_60=1, var_65=4, var_67=5, var_6=0, var_71=3, var_99=0] [L212] var_32 = var_32 & mask_SORT_1 [L213] SORT_1 bad_33_arg_0 = var_32; [L214] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1354 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8387 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8387 mSDsluCounter, 60197 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48467 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12534 IncrementalHoareTripleChecker+Invalid, 12542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 11730 mSDtfsCounter, 12534 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1378occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 150 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:03:44,112 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.vis_arrays_vsa16a_p4.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 2164f122c5c32edee2ede3aaa086ed34ce5834fc0fb4a31a890516c48b14c747 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:03:46,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:03:46,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:03:46,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:03:46,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:03:46,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:03:46,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:03:46,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:03:46,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:03:46,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:03:46,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:03:46,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:03:46,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:03:46,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:03:46,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:03:46,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:03:46,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:03:46,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:03:46,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:03:46,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:03:46,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:03:46,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:03:46,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:03:46,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:03:46,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:03:46,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:03:46,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:03:46,604 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:03:46,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:03:46,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:03:46,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:03:46,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:03:46,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:03:46,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:03:46,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:03:46,606 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:03:46,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:03:46,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:03:46,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:03:46,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:03:46,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:03:46,609 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 -> 2164f122c5c32edee2ede3aaa086ed34ce5834fc0fb4a31a890516c48b14c747 [2024-11-10 03:03:46,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:03:46,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:03:46,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:03:46,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:03:46,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:03:46,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c [2024-11-10 03:03:48,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:03:48,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:03:48,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c [2024-11-10 03:03:48,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a77daf05/916befeb9baa447fae49704931eaae2f/FLAG6c215b812 [2024-11-10 03:03:48,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a77daf05/916befeb9baa447fae49704931eaae2f [2024-11-10 03:03:48,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:03:48,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:03:48,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:03:48,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:03:48,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:03:48,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:48" (1/1) ... [2024-11-10 03:03:48,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5696fbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:48, skipping insertion in model container [2024-11-10 03:03:48,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:48" (1/1) ... [2024-11-10 03:03:49,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:03:49,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c[1260,1273] [2024-11-10 03:03:49,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:03:49,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:03:49,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p4.c[1260,1273] [2024-11-10 03:03:49,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:03:49,851 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:03:49,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49 WrapperNode [2024-11-10 03:03:49,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:03:49,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:03:49,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:03:49,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:03:49,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:49,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,039 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1824 [2024-11-10 03:03:50,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:03:50,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:03:50,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:03:50,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:03:50,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:03:50,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:03:50,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:03:50,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:03:50,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:03:50,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (1/1) ... [2024-11-10 03:03:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:03:50,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:03:50,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:03:50,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:03:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:03:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:03:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:03:50,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:03:50,718 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:03:50,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:03:53,398 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-10 03:03:53,398 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:03:53,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:03:53,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:03:53,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:53 BoogieIcfgContainer [2024-11-10 03:03:53,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:03:53,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:03:53,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:03:53,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:03:53,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:03:48" (1/3) ... [2024-11-10 03:03:53,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44728f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:03:53, skipping insertion in model container [2024-11-10 03:03:53,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:49" (2/3) ... [2024-11-10 03:03:53,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44728f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:03:53, skipping insertion in model container [2024-11-10 03:03:53,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:53" (3/3) ... [2024-11-10 03:03:53,416 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p4.c [2024-11-10 03:03:53,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:03:53,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:03:53,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:03:53,493 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;@489573aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:03:53,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:03:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:03:53,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:53,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:03:53,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:03:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:03:53,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659557969] [2024-11-10 03:03:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:53,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:03:53,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:03:53,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:03:53,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:03:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:53,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 03:03:53,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:03:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:54,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:03:54,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:03:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659557969] [2024-11-10 03:03:54,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659557969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:54,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:54,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:03:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747221715] [2024-11-10 03:03:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:54,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:03:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:03:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:03:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:54,163 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:54,307 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 03:03:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:03:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 03:03:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:54,317 INFO L225 Difference]: With dead ends: 22 [2024-11-10 03:03:54,317 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 03:03:54,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:03:54,324 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:54,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:03:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 03:03:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 03:03:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 03:03:54,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 03:03:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:54,356 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 03:03:54,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 03:03:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 03:03:54,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:54,357 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:03:54,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:03:54,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:03:54,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:54,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 03:03:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:03:54,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676863354] [2024-11-10 03:03:54,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:54,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:03:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:03:54,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:03:54,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:03:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:55,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 03:03:55,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:03:55,562 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-10 03:03:55,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:04:00,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_16~0#1|))) (let ((.cse5 (= .cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_65~0#1|)))) (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_60~0#1|))))))) (.cse1 (not .cse5)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_19~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_9~0#1|)) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_15~0#1|))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_27_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_26_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_32_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_32_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_27_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_26_arg_1~0#1_10|))))))))))))))) (_ bv0 8))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|)))) (_ bv1 32)))))))))) (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|)))) (_ bv1 32)))) .cse3)))))))) (or (forall ((|v_ULTIMATE.start_main_~var_27_arg_0~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_26_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_32_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_32_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_27_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_26_arg_1~0#1_10|))))))))))))))))) (and (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (not (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|)))) (_ bv1 32)))) .cse3))))))) (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_14~0#1| (_ BitVec 8))) (not (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_14~0#1|)))) (_ bv1 32))))))))))))))))) is different from false [2024-11-10 03:04:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 03:04:01,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:04:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676863354] [2024-11-10 03:04:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676863354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:04:01,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:04:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 03:04:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373663627] [2024-11-10 03:04:01,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:04:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:04:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:04:01,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:04:01,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-10 03:04:01,495 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-10 03:04:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:02,261 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-10 03:04:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:04:02,262 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-10 03:04:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:02,263 INFO L225 Difference]: With dead ends: 17 [2024-11-10 03:04:02,263 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 03:04:02,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-10 03:04:02,265 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:02,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2024-11-10 03:04:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 03:04:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-10 03:04:02,270 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-10 03:04:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 03:04:02,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 03:04:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:02,271 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 03:04:02,271 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-10 03:04:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 03:04:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 03:04:02,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:02,272 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 03:04:02,281 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-10 03:04:02,472 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-10 03:04:02,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:02,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 03:04:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213933367] [2024-11-10 03:04:02,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 03:04:02,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:04:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:02,480 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-10 03:04:02,482 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-10 03:04:03,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 03:04:03,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 03:04:03,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 03:04:03,809 INFO L278 TraceCheckSpWp]: Computing forward predicates...