./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:19:51,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:19:51,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:19:51,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:19:51,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:19:51,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:19:51,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:19:51,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:19:51,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:19:51,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:19:51,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:19:51,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:19:51,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:19:51,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:51,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:51,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:19:51,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:19:51,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2025-01-09 08:19:51,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:19:51,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:19:51,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:19:51,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:19:51,768 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:19:51,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-01-09 08:19:52,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e219d96/8b405a01079844a4adaaa1ade96b6868/FLAGeace666c1 [2025-01-09 08:19:53,270 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:19:53,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-01-09 08:19:53,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e219d96/8b405a01079844a4adaaa1ade96b6868/FLAGeace666c1 [2025-01-09 08:19:53,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e219d96/8b405a01079844a4adaaa1ade96b6868 [2025-01-09 08:19:53,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:19:53,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:19:53,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:53,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:19:53,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:19:53,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:53" (1/1) ... [2025-01-09 08:19:53,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b2a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:53, skipping insertion in model container [2025-01-09 08:19:53,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:53" (1/1) ... [2025-01-09 08:19:53,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:19:53,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-01-09 08:19:53,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:53,897 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:19:53,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-01-09 08:19:54,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:54,044 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:19:54,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54 WrapperNode [2025-01-09 08:19:54,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:54,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:54,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:19:54,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:19:54,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,437 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4859 [2025-01-09 08:19:54,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:54,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:19:54,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:19:54,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:19:54,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,653 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]. [2025-01-09 08:19:54,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:19:54,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:19:54,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:19:54,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:19:54,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (1/1) ... [2025-01-09 08:19:54,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:54,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:54,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:19:54,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:19:54,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:19:54,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:19:54,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:19:54,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:19:55,388 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:19:55,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:19:58,740 INFO L? ?]: Removed 2854 outVars from TransFormulas that were not future-live. [2025-01-09 08:19:58,740 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:19:58,775 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:19:58,778 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:19:58,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:58 BoogieIcfgContainer [2025-01-09 08:19:58,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:19:58,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:19:58,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:19:58,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:19:58,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:19:53" (1/3) ... [2025-01-09 08:19:58,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ed0586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:58, skipping insertion in model container [2025-01-09 08:19:58,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:54" (2/3) ... [2025-01-09 08:19:58,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ed0586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:58, skipping insertion in model container [2025-01-09 08:19:58,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:58" (3/3) ... [2025-01-09 08:19:58,785 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-01-09 08:19:58,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:19:58,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c that has 1 procedures, 1522 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:19:58,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:19:58,861 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;@6a919ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:19:58,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:19:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 1522 states, 1520 states have (on average 1.499342105263158) internal successors, (2279), 1521 states have internal predecessors, (2279), 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) [2025-01-09 08:19:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 08:19:58,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:58,870 INFO L218 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] [2025-01-09 08:19:58,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:58,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:58,874 INFO L85 PathProgramCache]: Analyzing trace with hash 755367884, now seen corresponding path program 1 times [2025-01-09 08:19:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:58,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636863771] [2025-01-09 08:19:58,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:58,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 08:19:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 08:19:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636863771] [2025-01-09 08:19:59,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636863771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:59,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078073890] [2025-01-09 08:19:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:59,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:59,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:59,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:59,608 INFO L87 Difference]: Start difference. First operand has 1522 states, 1520 states have (on average 1.499342105263158) internal successors, (2279), 1521 states have internal predecessors, (2279), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2025-01-09 08:19:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:59,835 INFO L93 Difference]: Finished difference Result 2997 states and 4491 transitions. [2025-01-09 08:19:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-01-09 08:19:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:59,860 INFO L225 Difference]: With dead ends: 2997 [2025-01-09 08:19:59,860 INFO L226 Difference]: Without dead ends: 1521 [2025-01-09 08:19:59,865 INFO L434 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 [2025-01-09 08:19:59,866 INFO L435 NwaCegarLoop]: 2273 mSDtfsCounter, 0 mSDsluCounter, 4540 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6813 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:59,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6813 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-01-09 08:19:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2025-01-09 08:19:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 1.4980263157894738) internal successors, (2277), 1520 states have internal predecessors, (2277), 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) [2025-01-09 08:19:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2277 transitions. [2025-01-09 08:19:59,956 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2277 transitions. Word has length 41 [2025-01-09 08:19:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:59,960 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2277 transitions. [2025-01-09 08:19:59,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2025-01-09 08:19:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2277 transitions. [2025-01-09 08:19:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 08:19:59,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:59,961 INFO L218 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] [2025-01-09 08:19:59,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:19:59,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1943263311, now seen corresponding path program 1 times [2025-01-09 08:19:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746813057] [2025-01-09 08:19:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:59,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 08:20:00,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 08:20:00,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:00,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746813057] [2025-01-09 08:20:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746813057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:00,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:00,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412916623] [2025-01-09 08:20:00,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:00,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:00,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:00,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:00,272 INFO L87 Difference]: Start difference. First operand 1521 states and 2277 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2025-01-09 08:20:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:00,334 INFO L93 Difference]: Finished difference Result 2998 states and 4489 transitions. [2025-01-09 08:20:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-01-09 08:20:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:00,341 INFO L225 Difference]: With dead ends: 2998 [2025-01-09 08:20:00,341 INFO L226 Difference]: Without dead ends: 1523 [2025-01-09 08:20:00,343 INFO L434 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 [2025-01-09 08:20:00,343 INFO L435 NwaCegarLoop]: 2273 mSDtfsCounter, 0 mSDsluCounter, 4536 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6809 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:00,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6809 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-01-09 08:20:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523. [2025-01-09 08:20:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.497371879106439) internal successors, (2279), 1522 states have internal predecessors, (2279), 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) [2025-01-09 08:20:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2279 transitions. [2025-01-09 08:20:00,368 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2279 transitions. Word has length 42 [2025-01-09 08:20:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 2279 transitions. [2025-01-09 08:20:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2025-01-09 08:20:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2279 transitions. [2025-01-09 08:20:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 08:20:00,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:00,371 INFO L218 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] [2025-01-09 08:20:00,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:20:00,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:00,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:00,375 INFO L85 PathProgramCache]: Analyzing trace with hash -986345211, now seen corresponding path program 1 times [2025-01-09 08:20:00,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:00,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772908365] [2025-01-09 08:20:00,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 08:20:00,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 08:20:00,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772908365] [2025-01-09 08:20:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772908365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:01,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:20:01,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967573015] [2025-01-09 08:20:01,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:01,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:20:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:01,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:20:01,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:01,142 INFO L87 Difference]: Start difference. First operand 1523 states and 2279 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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) [2025-01-09 08:20:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:01,373 INFO L93 Difference]: Finished difference Result 3020 states and 4520 transitions. [2025-01-09 08:20:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:20:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 43 [2025-01-09 08:20:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:01,379 INFO L225 Difference]: With dead ends: 3020 [2025-01-09 08:20:01,379 INFO L226 Difference]: Without dead ends: 1543 [2025-01-09 08:20:01,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:20:01,381 INFO L435 NwaCegarLoop]: 2261 mSDtfsCounter, 2294 mSDsluCounter, 13553 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 15814 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:01,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 15814 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-01-09 08:20:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1539. [2025-01-09 08:20:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1538 states have (on average 1.4960988296488946) internal successors, (2301), 1538 states have internal predecessors, (2301), 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) [2025-01-09 08:20:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2301 transitions. [2025-01-09 08:20:01,405 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2301 transitions. Word has length 43 [2025-01-09 08:20:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:01,405 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2301 transitions. [2025-01-09 08:20:01,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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) [2025-01-09 08:20:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2301 transitions. [2025-01-09 08:20:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:20:01,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:01,408 INFO L218 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] [2025-01-09 08:20:01,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:20:01,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash 542126685, now seen corresponding path program 1 times [2025-01-09 08:20:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:01,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423097985] [2025-01-09 08:20:01,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:01,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:01,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:20:01,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:20:01,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:01,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423097985] [2025-01-09 08:20:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423097985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:02,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:20:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518651586] [2025-01-09 08:20:02,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:02,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:20:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:02,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:20:02,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:02,091 INFO L87 Difference]: Start difference. First operand 1539 states and 2301 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) [2025-01-09 08:20:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:02,576 INFO L93 Difference]: Finished difference Result 3023 states and 4522 transitions. [2025-01-09 08:20:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:20:02,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 44 [2025-01-09 08:20:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:02,580 INFO L225 Difference]: With dead ends: 3023 [2025-01-09 08:20:02,581 INFO L226 Difference]: Without dead ends: 1546 [2025-01-09 08:20:02,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:20:02,583 INFO L435 NwaCegarLoop]: 2203 mSDtfsCounter, 2291 mSDsluCounter, 13206 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 15409 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:02,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 15409 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:20:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-01-09 08:20:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1540. [2025-01-09 08:20:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.4964262508122157) internal successors, (2303), 1539 states have internal predecessors, (2303), 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) [2025-01-09 08:20:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2303 transitions. [2025-01-09 08:20:02,603 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2303 transitions. Word has length 44 [2025-01-09 08:20:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:02,603 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2303 transitions. [2025-01-09 08:20:02,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) [2025-01-09 08:20:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2303 transitions. [2025-01-09 08:20:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 08:20:02,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:02,604 INFO L218 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] [2025-01-09 08:20:02,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:20:02,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash 396956566, now seen corresponding path program 1 times [2025-01-09 08:20:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51335050] [2025-01-09 08:20:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:02,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 08:20:02,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 08:20:02,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:02,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51335050] [2025-01-09 08:20:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51335050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:20:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971246012] [2025-01-09 08:20:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:20:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:03,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:20:03,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:03,031 INFO L87 Difference]: Start difference. First operand 1540 states and 2303 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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) [2025-01-09 08:20:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:03,330 INFO L93 Difference]: Finished difference Result 3027 states and 4528 transitions. [2025-01-09 08:20:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:20:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 44 [2025-01-09 08:20:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:03,336 INFO L225 Difference]: With dead ends: 3027 [2025-01-09 08:20:03,337 INFO L226 Difference]: Without dead ends: 1550 [2025-01-09 08:20:03,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 08:20:03,339 INFO L435 NwaCegarLoop]: 2252 mSDtfsCounter, 2301 mSDsluCounter, 15754 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 18006 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:03,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2301 Valid, 18006 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-01-09 08:20:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1547. [2025-01-09 08:20:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 1.4954721862871927) internal successors, (2312), 1546 states have internal predecessors, (2312), 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) [2025-01-09 08:20:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2312 transitions. [2025-01-09 08:20:03,369 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2312 transitions. Word has length 44 [2025-01-09 08:20:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:03,369 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2312 transitions. [2025-01-09 08:20:03,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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) [2025-01-09 08:20:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2312 transitions. [2025-01-09 08:20:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:20:03,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:03,370 INFO L218 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] [2025-01-09 08:20:03,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:20:03,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:03,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash 985296993, now seen corresponding path program 1 times [2025-01-09 08:20:03,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:03,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012591553] [2025-01-09 08:20:03,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:03,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:03,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:20:03,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:20:03,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:03,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:20:03,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:20:03,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:20:03,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:20:03,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:03,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:20:03,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:20:03,590 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:20:03,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:20:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:20:03,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 08:20:03,630 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:20:03,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:20:03 BoogieIcfgContainer [2025-01-09 08:20:03,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:20:03,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:20:03,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:20:03,633 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:20:03,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:58" (3/4) ... [2025-01-09 08:20:03,635 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:20:03,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:20:03,636 INFO L158 Benchmark]: Toolchain (without parser) took 10148.30ms. Allocated memory was 201.3MB in the beginning and 738.2MB in the end (delta: 536.9MB). Free memory was 152.2MB in the beginning and 556.6MB in the end (delta: -404.5MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2025-01-09 08:20:03,636 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:20:03,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.44ms. Allocated memory is still 201.3MB. Free memory was 152.2MB in the beginning and 77.6MB in the end (delta: 74.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 08:20:03,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 391.47ms. Allocated memory is still 201.3MB. Free memory was 77.6MB in the beginning and 86.7MB in the end (delta: -9.1MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2025-01-09 08:20:03,637 INFO L158 Benchmark]: Boogie Preprocessor took 498.16ms. Allocated memory is still 201.3MB. Free memory was 86.7MB in the beginning and 59.6MB in the end (delta: 27.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 08:20:03,637 INFO L158 Benchmark]: RCFGBuilder took 3841.45ms. Allocated memory was 201.3MB in the beginning and 612.4MB in the end (delta: 411.0MB). Free memory was 59.6MB in the beginning and 210.6MB in the end (delta: -151.0MB). Peak memory consumption was 368.2MB. Max. memory is 16.1GB. [2025-01-09 08:20:03,637 INFO L158 Benchmark]: TraceAbstraction took 4851.40ms. Allocated memory was 612.4MB in the beginning and 738.2MB in the end (delta: 125.8MB). Free memory was 210.6MB in the beginning and 556.7MB in the end (delta: -346.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:20:03,638 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 738.2MB. Free memory was 556.7MB in the beginning and 556.6MB in the end (delta: 95.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:20:03,639 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.44ms. Allocated memory is still 201.3MB. Free memory was 152.2MB in the beginning and 77.6MB in the end (delta: 74.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 391.47ms. Allocated memory is still 201.3MB. Free memory was 77.6MB in the beginning and 86.7MB in the end (delta: -9.1MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 498.16ms. Allocated memory is still 201.3MB. Free memory was 86.7MB in the beginning and 59.6MB in the end (delta: 27.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3841.45ms. Allocated memory was 201.3MB in the beginning and 612.4MB in the end (delta: 411.0MB). Free memory was 59.6MB in the beginning and 210.6MB in the end (delta: -151.0MB). Peak memory consumption was 368.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4851.40ms. Allocated memory was 612.4MB in the beginning and 738.2MB in the end (delta: 125.8MB). Free memory was 210.6MB in the beginning and 556.7MB in the end (delta: -346.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 738.2MB. Free memory was 556.7MB in the beginning and 556.6MB in the end (delta: 95.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 214. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 12); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (12 - 1); [L29] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 1); [L30] const SORT_8 msb_SORT_8 = (SORT_8)1 << (1 - 1); [L32] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 4); [L33] const SORT_13 msb_SORT_13 = (SORT_13)1 << (4 - 1); [L35] const SORT_97 mask_SORT_97 = (SORT_97)-1 >> (sizeof(SORT_97) * 8 - 3); [L36] const SORT_97 msb_SORT_97 = (SORT_97)1 << (3 - 1); [L38] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 2); [L39] const SORT_305 msb_SORT_305 = (SORT_305)1 << (2 - 1); [L41] const SORT_309 mask_SORT_309 = (SORT_309)-1 >> (sizeof(SORT_309) * 8 - 5); [L42] const SORT_309 msb_SORT_309 = (SORT_309)1 << (5 - 1); [L44] const SORT_311 mask_SORT_311 = (SORT_311)-1 >> (sizeof(SORT_311) * 8 - 6); [L45] const SORT_311 msb_SORT_311 = (SORT_311)1 << (6 - 1); [L47] const SORT_313 mask_SORT_313 = (SORT_313)-1 >> (sizeof(SORT_313) * 8 - 7); [L48] const SORT_313 msb_SORT_313 = (SORT_313)1 << (7 - 1); [L50] const SORT_315 mask_SORT_315 = (SORT_315)-1 >> (sizeof(SORT_315) * 8 - 8); [L51] const SORT_315 msb_SORT_315 = (SORT_315)1 << (8 - 1); [L53] const SORT_317 mask_SORT_317 = (SORT_317)-1 >> (sizeof(SORT_317) * 8 - 9); [L54] const SORT_317 msb_SORT_317 = (SORT_317)1 << (9 - 1); [L56] const SORT_319 mask_SORT_319 = (SORT_319)-1 >> (sizeof(SORT_319) * 8 - 10); [L57] const SORT_319 msb_SORT_319 = (SORT_319)1 << (10 - 1); [L59] const SORT_321 mask_SORT_321 = (SORT_321)-1 >> (sizeof(SORT_321) * 8 - 11); [L60] const SORT_321 msb_SORT_321 = (SORT_321)1 << (11 - 1); [L62] const SORT_8 var_18 = 0; [L63] const SORT_1 var_22 = 0; [L64] const SORT_1 var_25 = 2; [L65] const SORT_1 var_47 = 1; [L66] const SORT_8 var_52 = 1; [L67] const SORT_13 var_56 = 2; [L68] const SORT_13 var_61 = 9; [L69] const SORT_13 var_69 = 15; [L70] const SORT_13 var_74 = 1; [L71] const SORT_13 var_76 = 3; [L72] const SORT_13 var_79 = 5; [L73] const SORT_13 var_82 = 7; [L74] const SORT_13 var_85 = 11; [L75] const SORT_97 var_98 = 0; [L76] const SORT_13 var_111 = 8; [L77] const SORT_13 var_115 = 10; [L78] const SORT_13 var_119 = 13; [L79] const SORT_13 var_130 = 4; [L80] const SORT_13 var_132 = 12; [L81] const SORT_13 var_135 = 14; [L82] const SORT_13 var_141 = 6; [L83] const SORT_13 var_168 = 0; [L84] const SORT_97 var_216 = 1; [L85] const SORT_97 var_218 = 5; [L86] const SORT_1 var_245 = 4095; [L87] const SORT_321 var_592 = 0; [L89] SORT_1 input_2; [L90] SORT_1 input_3; [L91] SORT_1 input_4; [L92] SORT_1 input_5; [L93] SORT_1 input_6; [L94] SORT_1 input_7; [L95] SORT_8 input_9; [L96] SORT_8 input_10; [L97] SORT_8 input_11; [L98] SORT_1 input_12; [L99] SORT_13 input_14; [L100] SORT_8 input_15; [L101] SORT_8 input_16; [L102] SORT_8 input_17; [L103] SORT_1 input_210; [L104] SORT_97 input_212; [L105] SORT_1 input_232; [L106] SORT_97 input_235; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L108] SORT_8 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_8; [L109] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L109] SORT_1 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L110] SORT_1 state_28 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L111] SORT_1 state_30 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L112] SORT_1 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L113] SORT_1 state_35 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L114] SORT_1 state_39 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L115] SORT_1 state_41 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L116] SORT_1 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_97 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L117] SORT_97 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_97; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L118] SORT_1 state_128 = __VERIFIER_nondet_ushort() & mask_SORT_1; [L120] SORT_8 init_20_arg_1 = var_18; [L121] state_19 = init_20_arg_1 [L122] SORT_1 init_24_arg_1 = var_22; [L123] state_23 = init_24_arg_1 [L124] SORT_1 init_29_arg_1 = var_22; [L125] state_28 = init_29_arg_1 [L126] SORT_1 init_31_arg_1 = var_22; [L127] state_30 = init_31_arg_1 [L128] SORT_1 init_34_arg_1 = var_22; [L129] state_33 = init_34_arg_1 [L130] SORT_1 init_36_arg_1 = var_22; [L131] state_35 = init_36_arg_1 [L132] SORT_1 init_40_arg_1 = var_22; [L133] state_39 = init_40_arg_1 [L134] SORT_1 init_42_arg_1 = var_22; [L135] state_41 = init_42_arg_1 [L136] SORT_1 init_59_arg_1 = var_22; [L137] state_58 = init_59_arg_1 [L138] SORT_97 init_100_arg_1 = var_98; [L139] state_99 = init_100_arg_1 [L140] SORT_1 init_129_arg_1 = var_22; [L141] state_128 = init_129_arg_1 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L144] input_2 = __VERIFIER_nondet_ushort() [L145] input_3 = __VERIFIER_nondet_ushort() [L146] input_4 = __VERIFIER_nondet_ushort() [L147] input_5 = __VERIFIER_nondet_ushort() [L148] input_6 = __VERIFIER_nondet_ushort() [L149] input_7 = __VERIFIER_nondet_ushort() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] input_10 = __VERIFIER_nondet_uchar() [L152] input_11 = __VERIFIER_nondet_uchar() [L153] EXPR input_11 & mask_SORT_8 VAL [mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L153] input_11 = input_11 & mask_SORT_8 [L154] input_12 = __VERIFIER_nondet_ushort() [L155] input_14 = __VERIFIER_nondet_uchar() [L156] EXPR input_14 & mask_SORT_13 VAL [input_11=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_19=0, state_23=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L156] input_14 = input_14 & mask_SORT_13 [L157] input_15 = __VERIFIER_nondet_uchar() [L158] input_16 = __VERIFIER_nondet_uchar() [L159] input_17 = __VERIFIER_nondet_uchar() [L160] input_210 = __VERIFIER_nondet_ushort() [L161] input_212 = __VERIFIER_nondet_uchar() [L162] input_232 = __VERIFIER_nondet_ushort() [L163] input_235 = __VERIFIER_nondet_uchar() [L166] SORT_8 var_21_arg_0 = state_19; [L167] SORT_8 var_21_arg_1 = var_18; [L168] SORT_8 var_21 = var_21_arg_0 == var_21_arg_1; [L169] SORT_1 var_26_arg_0 = state_23; [L170] SORT_1 var_26_arg_1 = var_25; [L171] SORT_8 var_26 = var_26_arg_0 != var_26_arg_1; [L172] SORT_8 var_27_arg_0 = var_21; [L173] SORT_8 var_27_arg_1 = var_26; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27_arg_0=1, var_27_arg_1=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L174] SORT_8 var_27 = var_27_arg_0 | var_27_arg_1; [L175] SORT_8 var_44_arg_0 = var_18; [L176] SORT_1 var_44_arg_1 = input_7; [L177] SORT_1 var_44_arg_2 = input_6; [L178] SORT_1 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L179] SORT_8 var_43_arg_0 = var_18; [L180] SORT_1 var_43_arg_1 = state_41; [L181] SORT_1 var_43_arg_2 = state_39; [L182] SORT_1 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L183] SORT_8 var_45_arg_0 = var_18; [L184] SORT_1 var_45_arg_1 = var_44; [L185] SORT_1 var_45_arg_2 = var_43; [L186] SORT_1 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L187] SORT_8 var_37_arg_0 = var_18; [L188] SORT_1 var_37_arg_1 = state_35; [L189] SORT_1 var_37_arg_2 = state_33; [L190] SORT_1 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L191] SORT_8 var_32_arg_0 = var_18; [L192] SORT_1 var_32_arg_1 = state_30; [L193] SORT_1 var_32_arg_2 = state_28; [L194] SORT_1 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L195] SORT_8 var_38_arg_0 = var_18; [L196] SORT_1 var_38_arg_1 = var_37; [L197] SORT_1 var_38_arg_2 = var_32; [L198] SORT_1 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L199] SORT_8 var_46_arg_0 = var_18; [L200] SORT_1 var_46_arg_1 = var_45; [L201] SORT_1 var_46_arg_2 = var_38; [L202] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_46=0, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] EXPR var_46 & mask_SORT_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_27=1, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L203] var_46 = var_46 & mask_SORT_1 [L204] SORT_1 var_48_arg_0 = var_46; [L205] SORT_1 var_48_arg_1 = var_47; [L206] SORT_8 var_48 = var_48_arg_0 == var_48_arg_1; [L207] SORT_8 var_49_arg_0 = var_27; [L208] SORT_8 var_49_arg_1 = var_48; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_49_arg_0=1, var_49_arg_1=0, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L209] SORT_8 var_49 = var_49_arg_0 | var_49_arg_1; [L210] SORT_8 var_53_arg_0 = var_49; [L211] SORT_8 var_53 = ~var_53_arg_0; [L212] SORT_8 var_54_arg_0 = var_52; [L213] SORT_8 var_54_arg_1 = var_53; VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_54_arg_0=1, var_54_arg_1=-2, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L214] SORT_8 var_54 = var_54_arg_0 & var_54_arg_1; [L215] EXPR var_54 & mask_SORT_8 VAL [input_11=0, input_14=0, mask_SORT_13=15, mask_SORT_1=4095, mask_SORT_305=3, mask_SORT_309=31, mask_SORT_311=63, mask_SORT_313=127, mask_SORT_315=255, mask_SORT_317=511, mask_SORT_319=1023, mask_SORT_321=2047, mask_SORT_8=1, mask_SORT_97=7, state_128=0, state_28=0, state_30=0, state_33=0, state_35=0, state_39=0, state_41=0, state_58=0, state_99=0, var_111=8, var_115=10, var_119=13, var_130=4, var_132=12, var_135=14, var_141=6, var_168=0, var_18=0, var_216=1, var_218=5, var_22=0, var_245=4095, var_25=2, var_47=1, var_52=1, var_56=2, var_592=0, var_61=9, var_69=15, var_74=1, var_76=3, var_79=5, var_82=7, var_85=11, var_98=0] [L215] var_54 = var_54 & mask_SORT_8 [L216] SORT_8 bad_55_arg_0 = var_54; [L217] CALL __VERIFIER_assert(!(bad_55_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1522 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6886 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6886 mSDsluCounter, 62851 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51589 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 866 IncrementalHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 11262 mSDtfsCounter, 866 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1547occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 1262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 08:20:03,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:20:05,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:20:06,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:20:06,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:20:06,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:20:06,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:20:06,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:20:06,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:20:06,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:20:06,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:20:06,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:20:06,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:20:06,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:20:06,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:20:06,037 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:20:06,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:20:06,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:20:06,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:20:06,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:20:06,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:20:06,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:06,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:06,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:06,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:20:06,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:20:06,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 03c3c0226be86be0ec03a0662affe26020abe8242f0c910b49f1d4231c5f2564 [2025-01-09 08:20:06,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:20:06,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:20:06,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:20:06,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:20:06,316 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:20:06,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-01-09 08:20:07,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5800df2e/d74c8040ea5642349f800e2b60ef7aac/FLAG1f70a2019 [2025-01-09 08:20:08,045 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:20:08,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-01-09 08:20:08,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5800df2e/d74c8040ea5642349f800e2b60ef7aac/FLAG1f70a2019 [2025-01-09 08:20:08,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5800df2e/d74c8040ea5642349f800e2b60ef7aac [2025-01-09 08:20:08,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:20:08,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:20:08,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:08,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:20:08,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:20:08,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e31ffa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08, skipping insertion in model container [2025-01-09 08:20:08,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:20:08,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-01-09 08:20:08,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:08,503 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:20:08,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p3.c[1260,1273] [2025-01-09 08:20:08,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:08,645 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:20:08,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08 WrapperNode [2025-01-09 08:20:08,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:08,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:08,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:20:08,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:20:08,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,769 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1835 [2025-01-09 08:20:08,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:08,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:20:08,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:20:08,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:20:08,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,811 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]. [2025-01-09 08:20:08,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:20:08,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:20:08,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:20:08,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:20:08,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (1/1) ... [2025-01-09 08:20:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:08,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:20:08,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:20:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:20:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:20:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:20:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:20:09,237 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:20:09,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:20:10,869 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-01-09 08:20:10,869 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:20:10,875 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:20:10,875 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:20:10,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:10 BoogieIcfgContainer [2025-01-09 08:20:10,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:20:10,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:20:10,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:20:10,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:20:10,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:20:08" (1/3) ... [2025-01-09 08:20:10,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc3a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:10, skipping insertion in model container [2025-01-09 08:20:10,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:08" (2/3) ... [2025-01-09 08:20:10,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc3a7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:10, skipping insertion in model container [2025-01-09 08:20:10,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:10" (3/3) ... [2025-01-09 08:20:10,882 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c [2025-01-09 08:20:10,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:20:10,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2910_p3.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:20:10,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:20:10,930 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;@2bab0016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:20:10,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:20:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2025-01-09 08:20:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:20:10,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:10,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:20:10,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:10,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:20:10,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:20:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478813919] [2025-01-09 08:20:10,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:10,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:10,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:20:11,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:20:11,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:20:11,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:11,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:11,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 08:20:11,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:11,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:20:11,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:20:11,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478813919] [2025-01-09 08:20:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478813919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:11,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095875060] [2025-01-09 08:20:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:11,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:20:11,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:11,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:11,526 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-09 08:20:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:11,692 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 08:20:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-01-09 08:20:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:11,699 INFO L225 Difference]: With dead ends: 17 [2025-01-09 08:20:11,700 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 08:20:11,702 INFO L434 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 [2025-01-09 08:20:11,705 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:11,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 08:20:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 08:20:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2025-01-09 08:20:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:20:11,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:20:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:11,729 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:20:11,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-01-09 08:20:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:20:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:20:11,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:11,729 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:11,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:20:11,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:11,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:11,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:20:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:20:11,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593797924] [2025-01-09 08:20:11,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:11,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:11,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:20:12,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:20:12,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:20:12,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:12,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:12,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 08:20:12,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:12,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:13,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:20:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593797924] [2025-01-09 08:20:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593797924] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:13,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:20:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 08:20:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441993445] [2025-01-09 08:20:13,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:20:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:20:13,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:20:13,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:13,062 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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) [2025-01-09 08:20:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:13,280 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-01-09 08:20:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Word has length 8 [2025-01-09 08:20:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:13,280 INFO L225 Difference]: With dead ends: 14 [2025-01-09 08:20:13,281 INFO L226 Difference]: Without dead ends: 12 [2025-01-09 08:20:13,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:13,281 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:13,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-09 08:20:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-09 08:20:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) [2025-01-09 08:20:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-09 08:20:13,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-01-09 08:20:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:13,286 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-09 08:20:13,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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) [2025-01-09 08:20:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-09 08:20:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 08:20:13,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:13,287 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-09 08:20:13,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:20:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:13,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2025-01-09 08:20:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:20:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509647428] [2025-01-09 08:20:13,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:20:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:13,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:13,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:13,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:20:13,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 08:20:14,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 08:20:14,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:20:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:14,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 08:20:14,045 INFO L279 TraceCheckSpWp]: Computing forward predicates...