./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd --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 1a2c18f59baead1d109170e3bc1aa0d58cc7f788c3fc781fbbe1fe40f9367554 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:31:29,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:31:29,764 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 15:31:29,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:31:29,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:31:29,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:31:29,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:31:29,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:31:29,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:31:29,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:31:29,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:31:29,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:31:29,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:31:29,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:31:29,833 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:31:29,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:31:29,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:31:29,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:31:29,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:31:29,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:31:29,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:31:29,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:31:29,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:31:29,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:31:29,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:31:29,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:31:29,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:31:29,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:31:29,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:31:29,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:31:29,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:31:29,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:31:29,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:31:29,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:31:29,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:31:29,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:31:29,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:31:29,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:31:29,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:31:29,840 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1a2c18f59baead1d109170e3bc1aa0d58cc7f788c3fc781fbbe1fe40f9367554 [2024-11-13 15:31:30,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:31:30,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:31:30,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:31:30,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:31:30,323 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:31:30,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c Unable to find full path for "g++" [2024-11-13 15:31:32,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:31:33,133 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:31:33,134 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2024-11-13 15:31:33,145 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data/0d54dcb0e/86e26b1b55ee42748ee0e89c0192c5a1/FLAGc783f085c [2024-11-13 15:31:33,164 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data/0d54dcb0e/86e26b1b55ee42748ee0e89c0192c5a1 [2024-11-13 15:31:33,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:31:33,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:31:33,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:31:33,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:31:33,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:31:33,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49035df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33, skipping insertion in model container [2024-11-13 15:31:33,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:31:33,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1249,1262] [2024-11-13 15:31:33,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:31:33,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:31:33,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1249,1262] [2024-11-13 15:31:33,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:31:33,482 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:31:33,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33 WrapperNode [2024-11-13 15:31:33,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:31:33,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:31:33,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:31:33,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:31:33,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,543 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-11-13 15:31:33,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:31:33,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:31:33,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:31:33,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:31:33,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,577 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:31:33,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:31:33,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:31:33,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:31:33,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:31:33,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (1/1) ... [2024-11-13 15:31:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:31:33,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:31:33,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:31:33,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:31:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:31:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:31:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:31:33,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:31:33,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:31:33,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:31:34,346 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-13 15:31:34,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:31:34,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:31:34,365 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:31:34,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:31:34 BoogieIcfgContainer [2024-11-13 15:31:34,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:31:34,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:31:34,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:31:34,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:31:34,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:31:33" (1/3) ... [2024-11-13 15:31:34,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360ee8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:31:34, skipping insertion in model container [2024-11-13 15:31:34,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:33" (2/3) ... [2024-11-13 15:31:34,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360ee8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:31:34, skipping insertion in model container [2024-11-13 15:31:34,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:31:34" (3/3) ... [2024-11-13 15:31:34,381 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2024-11-13 15:31:34,404 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:31:34,406 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.counter_v.c that has 1 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:31:34,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:31:34,523 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;@1a12f176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:31:34,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:31:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 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) [2024-11-13 15:31:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 15:31:34,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:34,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:31:34,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -209312282, now seen corresponding path program 1 times [2024-11-13 15:31:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:31:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950091284] [2024-11-13 15:31:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:31:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:31:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:35,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:31:35,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950091284] [2024-11-13 15:31:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950091284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:31:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:31:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:31:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995233657] [2024-11-13 15:31:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:31:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:31:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:31:35,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:31:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:31:35,337 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:31:35,407 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2024-11-13 15:31:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:31:35,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 15:31:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:31:35,428 INFO L225 Difference]: With dead ends: 53 [2024-11-13 15:31:35,428 INFO L226 Difference]: Without dead ends: 29 [2024-11-13 15:31:35,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:31:35,440 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:31:35,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:31:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-13 15:31:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-13 15:31:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-13 15:31:35,488 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2024-11-13 15:31:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:31:35,488 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-13 15:31:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-13 15:31:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:31:35,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:35,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:31:35,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:31:35,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:35,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2102949055, now seen corresponding path program 1 times [2024-11-13 15:31:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:31:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468159027] [2024-11-13 15:31:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:31:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:31:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:31:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468159027] [2024-11-13 15:31:35,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468159027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:31:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:31:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:31:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108284210] [2024-11-13 15:31:35,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:31:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:31:35,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:31:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:31:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:31:35,841 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:31:35,910 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2024-11-13 15:31:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:31:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 14 [2024-11-13 15:31:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:31:35,915 INFO L225 Difference]: With dead ends: 54 [2024-11-13 15:31:35,915 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 15:31:35,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:31:35,916 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:31:35,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:31:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 15:31:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 15:31:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 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) [2024-11-13 15:31:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-13 15:31:35,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2024-11-13 15:31:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:31:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-13 15:31:35,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-13 15:31:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 15:31:35,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:35,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:31:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:31:35,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:35,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash -331054625, now seen corresponding path program 1 times [2024-11-13 15:31:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:31:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399196263] [2024-11-13 15:31:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:31:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:31:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:31:36,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399196263] [2024-11-13 15:31:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399196263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:31:36,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:31:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:31:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220314130] [2024-11-13 15:31:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:31:36,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:31:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:31:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:31:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:31:36,293 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:31:36,360 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-11-13 15:31:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:31:36,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 15:31:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:31:36,361 INFO L225 Difference]: With dead ends: 54 [2024-11-13 15:31:36,362 INFO L226 Difference]: Without dead ends: 29 [2024-11-13 15:31:36,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:31:36,363 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:31:36,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:31:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-13 15:31:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-13 15:31:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-13 15:31:36,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-13 15:31:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:31:36,377 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-13 15:31:36,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-13 15:31:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 15:31:36,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:36,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:31:36,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:31:36,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:36,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash -108213630, now seen corresponding path program 1 times [2024-11-13 15:31:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:31:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585208312] [2024-11-13 15:31:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:31:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:31:36,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:31:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:31:36,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:31:36,501 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:31:36,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:31:36,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:31:36,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 15:31:36,538 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:31:36,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:31:36 BoogieIcfgContainer [2024-11-13 15:31:36,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:31:36,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:31:36,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:31:36,545 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:31:36,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:31:34" (3/4) ... [2024-11-13 15:31:36,549 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:31:36,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:31:36,552 INFO L158 Benchmark]: Toolchain (without parser) took 3382.38ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 46.8MB in the end (delta: 52.8MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-11-13 15:31:36,552 INFO L158 Benchmark]: CDTParser took 1.40ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:31:36,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.06ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 87.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:31:36,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.19ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 84.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:31:36,554 INFO L158 Benchmark]: Boogie Preprocessor took 53.04ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:31:36,555 INFO L158 Benchmark]: RCFGBuilder took 769.02ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 64.8MB in the end (delta: 18.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:31:36,555 INFO L158 Benchmark]: TraceAbstraction took 2173.95ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 47.5MB in the end (delta: 17.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-13 15:31:36,556 INFO L158 Benchmark]: Witness Printer took 6.21ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 46.8MB in the end (delta: 710.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:31:36,559 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.06ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 87.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.19ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 84.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.04ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 769.02ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 64.8MB in the end (delta: 18.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2173.95ms. Allocated memory is still 142.6MB. Free memory was 64.5MB in the beginning and 47.5MB in the end (delta: 17.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 6.21ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 46.8MB in the end (delta: 710.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 57. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 15; [L34] const SORT_1 var_12 = 1; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_12=1, var_5=1, var_8=15] [L39] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] SORT_4 init_7_arg_1 = var_5; [L42] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_5=1, var_8=15] [L57] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 101 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:31:36,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd --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 1a2c18f59baead1d109170e3bc1aa0d58cc7f788c3fc781fbbe1fe40f9367554 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:31:40,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:31:40,831 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-13 15:31:40,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:31:40,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:31:40,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:31:40,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:31:40,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:31:40,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:31:40,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:31:40,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:31:40,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:31:40,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:31:40,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:31:40,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:31:40,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:31:40,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:31:40,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:31:40,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:31:40,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:31:40,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:31:40,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:31:40,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:31:40,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:31:40,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:31:40,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:31:40,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:31:40,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:31:40,886 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:31:40,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:31:40,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:31:40,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:31:40,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:31:40,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:31:40,889 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1a2c18f59baead1d109170e3bc1aa0d58cc7f788c3fc781fbbe1fe40f9367554 [2024-11-13 15:31:41,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:31:41,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:31:41,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:31:41,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:31:41,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:31:41,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c Unable to find full path for "g++" [2024-11-13 15:31:44,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:31:44,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:31:44,340 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2024-11-13 15:31:44,351 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data/2a8d0b992/23a4f407831f4a57bc5099f1d6030e2c/FLAGf7d0a1898 [2024-11-13 15:31:44,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/data/2a8d0b992/23a4f407831f4a57bc5099f1d6030e2c [2024-11-13 15:31:44,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:31:44,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:31:44,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:31:44,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:31:44,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:31:44,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35403a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44, skipping insertion in model container [2024-11-13 15:31:44,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:31:44,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1249,1262] [2024-11-13 15:31:44,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:31:44,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:31:44,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1249,1262] [2024-11-13 15:31:44,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:31:44,812 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:31:44,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44 WrapperNode [2024-11-13 15:31:44,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:31:44,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:31:44,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:31:44,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:31:44,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,867 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-13 15:31:44,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:31:44,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:31:44,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:31:44,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:31:44,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:31:44,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:31:44,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:31:44,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:31:44,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:31:44,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (1/1) ... [2024-11-13 15:31:44,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:31:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:31:44,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:31:44,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:31:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:31:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:31:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:31:45,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:31:45,133 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:31:45,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:31:45,414 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 15:31:45,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:31:45,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:31:45,426 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:31:45,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:31:45 BoogieIcfgContainer [2024-11-13 15:31:45,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:31:45,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:31:45,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:31:45,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:31:45,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:31:44" (1/3) ... [2024-11-13 15:31:45,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c12fe68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:31:45, skipping insertion in model container [2024-11-13 15:31:45,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:31:44" (2/3) ... [2024-11-13 15:31:45,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c12fe68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:31:45, skipping insertion in model container [2024-11-13 15:31:45,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:31:45" (3/3) ... [2024-11-13 15:31:45,444 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2024-11-13 15:31:45,461 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:31:45,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.counter_v.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:31:45,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:31:45,544 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;@5d3db10f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:31:45,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:31:45,550 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) [2024-11-13 15:31:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 15:31:45,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:45,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 15:31:45,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-13 15:31:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:31:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127935883] [2024-11-13 15:31:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:45,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:31:45,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:31:45,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:31:45,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:31:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:31:45,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 15:31:45,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:31:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:46,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:31:46,098 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:31:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127935883] [2024-11-13 15:31:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127935883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:31:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:31:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:31:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103457703] [2024-11-13 15:31:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:31:46,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:31:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:31:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:31:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:31:46,135 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) [2024-11-13 15:31:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:31:46,203 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-13 15:31:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:31:46,207 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 [2024-11-13 15:31:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:31:46,216 INFO L225 Difference]: With dead ends: 18 [2024-11-13 15:31:46,216 INFO L226 Difference]: Without dead ends: 10 [2024-11-13 15:31:46,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:31:46,223 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:31:46,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:31:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-13 15:31:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-13 15:31:46,259 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) [2024-11-13 15:31:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-13 15:31:46,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-13 15:31:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:31:46,270 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-13 15:31:46,270 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) [2024-11-13 15:31:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-13 15:31:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 15:31:46,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:46,272 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-13 15:31:46,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:31:46,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:31:46,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:46,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-13 15:31:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:31:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460908966] [2024-11-13 15:31:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:31:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:31:46,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:31:46,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:31:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:31:46,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 15:31:46,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:31:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:47,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:31:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:50,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:31:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460908966] [2024-11-13 15:31:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460908966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:31:50,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:31:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-13 15:31:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528716132] [2024-11-13 15:31:50,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:31:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:31:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:31:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:31:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:31:50,393 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) [2024-11-13 15:31:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:31:51,520 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-13 15:31:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:31:51,522 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 [2024-11-13 15:31:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:31:51,523 INFO L225 Difference]: With dead ends: 18 [2024-11-13 15:31:51,523 INFO L226 Difference]: Without dead ends: 16 [2024-11-13 15:31:51,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:31:51,525 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:31:51,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:31:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-13 15:31:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-13 15:31:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:31:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-13 15:31:51,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-13 15:31:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:31:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-13 15:31:51,533 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) [2024-11-13 15:31:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-13 15:31:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 15:31:51,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:31:51,534 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-13 15:31:51,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:31:51,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:31:51,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:31:51,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:31:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-13 15:31:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:31:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615631802] [2024-11-13 15:31:51,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:31:51,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:31:51,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:31:51,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:31:51,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:31:51,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:31:51,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:31:51,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 15:31:51,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:31:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:31:54,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:32:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:32:10,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:32:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615631802] [2024-11-13 15:32:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615631802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:32:10,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:32:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-13 15:32:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722915534] [2024-11-13 15:32:10,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:32:10,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:32:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:32:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:32:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:32:10,145 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:32:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:16,942 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-13 15:32:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:32:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 14 [2024-11-13 15:32:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:16,944 INFO L225 Difference]: With dead ends: 30 [2024-11-13 15:32:16,944 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 15:32:16,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=267, Invalid=489, Unknown=0, NotChecked=0, Total=756 [2024-11-13 15:32:16,946 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:16,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:32:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 15:32:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-13 15:32:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:32:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-13 15:32:16,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-13 15:32:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:16,957 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-13 15:32:16,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:32:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-13 15:32:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:32:16,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:16,958 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-13 15:32:16,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:32:17,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:32:17,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:17,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-13 15:32:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:32:17,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432998513] [2024-11-13 15:32:17,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:32:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:32:17,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:32:17,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:32:17,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:32:17,351 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-13 15:32:17,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:32:17,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 15:32:17,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:32:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:32:22,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:33:39,027 WARN L286 SmtUtils]: Spent 9.81s on a formula simplification that was a NOOP. DAG size: 1889 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:35:36,867 WARN L286 SmtUtils]: Spent 26.73s on a formula simplification that was a NOOP. DAG size: 3779 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:36:44,850 WARN L286 SmtUtils]: Spent 24.23s on a formula simplification that was a NOOP. DAG size: 3783 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:37:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:31,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:37:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432998513] [2024-11-13 15:37:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432998513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:37:31,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:37:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-11-13 15:37:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688467689] [2024-11-13 15:37:31,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:37:31,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 15:37:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:37:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 15:37:31,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2024-11-13 15:37:31,473 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:51,704 WARN L286 SmtUtils]: Spent 18.57s on a formula simplification. DAG size of input: 1917 DAG size of output: 1154 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:38:10,600 WARN L286 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 1920 DAG size of output: 1156 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:38:11,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:38:18,804 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 1046 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:38:25,668 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 1049 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:38:29,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:38:33,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:38:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:38:48,809 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-13 15:38:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 15:38:48,810 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-13 15:38:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:38:48,811 INFO L225 Difference]: With dead ends: 51 [2024-11-13 15:38:48,811 INFO L226 Difference]: Without dead ends: 49 [2024-11-13 15:38:48,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 151.8s TimeCoverageRelationStatistics Valid=869, Invalid=1581, Unknown=0, NotChecked=0, Total=2450 [2024-11-13 15:38:48,814 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:38:48,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2024-11-13 15:38:48,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-13 15:38:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-13 15:38:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:38:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-11-13 15:38:48,841 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 26 [2024-11-13 15:38:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:38:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2024-11-13 15:38:48,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:38:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-11-13 15:38:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:38:48,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:38:48,843 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2024-11-13 15:38:48,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:38:49,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:38:49,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:38:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:38:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2022058043, now seen corresponding path program 4 times [2024-11-13 15:38:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:38:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113777031] [2024-11-13 15:38:49,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 15:38:49,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:38:49,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:38:49,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:38:49,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:38:49,317 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 15:38:49,317 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 15:38:49,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:38:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:38:49,671 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 15:38:49,672 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:38:49,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:38:49,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:38:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:38:49,885 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-13 15:38:49,940 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:38:49,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:38:49 BoogieIcfgContainer [2024-11-13 15:38:49,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:38:49,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:38:49,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:38:49,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:38:49,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:31:45" (3/4) ... [2024-11-13 15:38:49,951 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 15:38:50,080 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:38:50,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:38:50,083 INFO L158 Benchmark]: Toolchain (without parser) took 425703.00ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 60.5MB in the beginning and 819.4MB in the end (delta: -758.9MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2024-11-13 15:38:50,084 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:38:50,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.56ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 48.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:38:50,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.91ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 46.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:38:50,086 INFO L158 Benchmark]: Boogie Preprocessor took 61.87ms. Allocated memory is still 83.9MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:38:50,087 INFO L158 Benchmark]: RCFGBuilder took 493.63ms. Allocated memory is still 83.9MB. Free memory was 45.4MB in the beginning and 33.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:38:50,088 INFO L158 Benchmark]: TraceAbstraction took 424516.67ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 32.9MB in the beginning and 826.1MB in the end (delta: -793.2MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2024-11-13 15:38:50,088 INFO L158 Benchmark]: Witness Printer took 131.95ms. Allocated memory is still 1.0GB. Free memory was 826.1MB in the beginning and 819.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:38:50,094 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.60ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.56ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 48.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.91ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 46.9MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.87ms. Allocated memory is still 83.9MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.63ms. Allocated memory is still 83.9MB. Free memory was 45.4MB in the beginning and 33.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 424516.67ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 32.9MB in the beginning and 826.1MB in the end (delta: -793.2MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. * Witness Printer took 131.95ms. Allocated memory is still 1.0GB. Free memory was 826.1MB in the beginning and 819.4MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 1; [L33] const SORT_4 var_8 = 15; [L34] const SORT_1 var_12 = 1; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L39] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] SORT_4 init_7_arg_1 = var_5; [L42] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, var_12=1, var_5=1, var_8=15] [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_15_arg_0)) [L62] SORT_4 var_18_arg_0 = state_6; [L63] SORT_4 var_18_arg_1 = var_8; [L64] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L65] SORT_4 var_17_arg_0 = state_6; [L66] SORT_4 var_17_arg_1 = var_5; [L67] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L68] SORT_1 var_19_arg_0 = var_18; [L69] SORT_4 var_19_arg_1 = var_5; [L70] SORT_4 var_19_arg_2 = var_17; [L71] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L72] SORT_1 var_20_arg_0 = input_3; [L73] SORT_4 var_20_arg_1 = var_19; [L74] SORT_4 var_20_arg_2 = state_6; [L75] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L76] var_20 = var_20 & mask_SORT_4 [L77] SORT_4 next_21_arg_1 = var_20; [L79] state_6 = next_21_arg_1 [L45] input_2 = __VERIFIER_nondet_uchar() [L46] input_3 = __VERIFIER_nondet_uchar() [L47] input_3 = input_3 & mask_SORT_1 [L50] SORT_4 var_9_arg_0 = state_6; [L51] SORT_4 var_9_arg_1 = var_8; [L52] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L53] SORT_1 var_13_arg_0 = var_9; [L54] SORT_1 var_13 = ~var_13_arg_0; [L55] SORT_1 var_14_arg_0 = var_12; [L56] SORT_1 var_14_arg_1 = var_13; [L57] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L58] var_14 = var_14 & mask_SORT_1 [L59] SORT_1 bad_15_arg_0 = var_14; [L60] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 424.4s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 85.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 12.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 16 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 167.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 336.5s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 37 QuantifiedInterpolants, 308665 SizeOfPredicates, 33 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 15:38:50,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11d3e5e0-e772-49d0-8950-7cfbc62bd3ae/bin/uautomizer-verify-qhAvR1uOyd/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE