./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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 54eceae7382bc15f3f6868c637e60b7eb166af5d1c4b040a6f157b03b87c995c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:52:36,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:52:36,852 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 13:52:36,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:52:36,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:52:36,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:52:36,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:52:36,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:52:36,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:52:36,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:52:36,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:52:36,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:52:36,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:52:36,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:52:36,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:52:36,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:52:36,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:52:36,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:52:36,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:52:36,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:52:36,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:52:36,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:52:36,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:52:36,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:52:36,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:52:36,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:52:36,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:52:36,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:52:36,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:52:36,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:52:36,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:52:36,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:52:36,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:52:36,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:52:36,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:52:36,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:52:36,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:52:36,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:52:36,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:52:36,919 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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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 -> 54eceae7382bc15f3f6868c637e60b7eb166af5d1c4b040a6f157b03b87c995c [2024-11-13 13:52:37,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:52:37,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:52:37,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:52:37,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:52:37,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:52:37,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c Unable to find full path for "g++" [2024-11-13 13:52:39,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:52:39,837 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:52:39,843 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c [2024-11-13 13:52:39,862 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data/42c5257b9/0b475de81e1749ed9a2d85d08484a97b/FLAGf85423816 [2024-11-13 13:52:39,892 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data/42c5257b9/0b475de81e1749ed9a2d85d08484a97b [2024-11-13 13:52:39,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:52:39,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:52:39,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:52:39,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:52:39,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:52:39,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:52:39" (1/1) ... [2024-11-13 13:52:39,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27bced1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:39, skipping insertion in model container [2024-11-13 13:52:39,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:52:39" (1/1) ... [2024-11-13 13:52:39,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:52:40,101 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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c[1263,1276] [2024-11-13 13:52:40,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:52:40,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:52:40,212 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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c[1263,1276] [2024-11-13 13:52:40,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:52:40,286 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:52:40,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40 WrapperNode [2024-11-13 13:52:40,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:52:40,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:52:40,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:52:40,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:52:40,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,387 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 277 [2024-11-13 13:52:40,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:52:40,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:52:40,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:52:40,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:52:40,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,427 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 13:52:40,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:52:40,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:52:40,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:52:40,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:52:40,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (1/1) ... [2024-11-13 13:52:40,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:52:40,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:52:40,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:52:40,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:52:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:52:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:52:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:52:40,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:52:40,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:52:40,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:52:41,504 INFO L? ?]: Removed 176 outVars from TransFormulas that were not future-live. [2024-11-13 13:52:41,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:52:41,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:52:41,521 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:52:41,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:52:41 BoogieIcfgContainer [2024-11-13 13:52:41,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:52:41,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:52:41,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:52:41,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:52:41,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:52:39" (1/3) ... [2024-11-13 13:52:41,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691dea25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:52:41, skipping insertion in model container [2024-11-13 13:52:41,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:40" (2/3) ... [2024-11-13 13:52:41,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691dea25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:52:41, skipping insertion in model container [2024-11-13 13:52:41,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:52:41" (3/3) ... [2024-11-13 13:52:41,536 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_traffic_light_example.c [2024-11-13 13:52:41,555 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:52:41,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_traffic_light_example.c that has 1 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:52:41,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:52:41,652 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;@571f455e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:52:41,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:52:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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 13:52:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 13:52:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:41,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:52:41,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:41,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1332240297, now seen corresponding path program 1 times [2024-11-13 13:52:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:52:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599012098] [2024-11-13 13:52:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:41,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:52:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:42,301 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 13:52:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:52:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599012098] [2024-11-13 13:52:42,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599012098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:52:42,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:52:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:52:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101694153] [2024-11-13 13:52:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:42,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:52:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:52:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:52:42,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:52:42,335 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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.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 13:52:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:42,395 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2024-11-13 13:52:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:52:42,402 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 13:52:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:42,411 INFO L225 Difference]: With dead ends: 97 [2024-11-13 13:52:42,411 INFO L226 Difference]: Without dead ends: 53 [2024-11-13 13:52:42,415 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 13:52:42,420 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 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 13:52:42,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:52:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-13 13:52:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-13 13:52:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 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 13:52:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-13 13:52:42,472 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 15 [2024-11-13 13:52:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:42,473 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-13 13:52:42,473 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 13:52:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-13 13:52:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:52:42,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:42,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:52:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:52:42,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:42,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1648528535, now seen corresponding path program 1 times [2024-11-13 13:52:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:52:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367576538] [2024-11-13 13:52:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:52:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:42,744 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 13:52:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:52:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367576538] [2024-11-13 13:52:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367576538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:52:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:52:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:52:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771574305] [2024-11-13 13:52:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:52:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:52:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:52:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:52:42,748 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:52:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:42,807 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2024-11-13 13:52:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:52:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:52:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:42,809 INFO L225 Difference]: With dead ends: 98 [2024-11-13 13:52:42,809 INFO L226 Difference]: Without dead ends: 55 [2024-11-13 13:52:42,809 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 13:52:42,810 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:52:42,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:52:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-13 13:52:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-13 13:52:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 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 13:52:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2024-11-13 13:52:42,817 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 16 [2024-11-13 13:52:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:42,817 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2024-11-13 13:52:42,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:52:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-11-13 13:52:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 13:52:42,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:42,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:52:42,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:52:42,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash -662742910, now seen corresponding path program 1 times [2024-11-13 13:52:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:52:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133255061] [2024-11-13 13:52:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:52:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:43,159 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 13:52:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:52:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133255061] [2024-11-13 13:52:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133255061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:52:43,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:52:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:52:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965053212] [2024-11-13 13:52:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:43,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:52:43,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:52:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:52:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:52:43,163 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 13:52:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:43,218 INFO L93 Difference]: Finished difference Result 98 states and 138 transitions. [2024-11-13 13:52:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:52:43,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-13 13:52:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:43,221 INFO L225 Difference]: With dead ends: 98 [2024-11-13 13:52:43,223 INFO L226 Difference]: Without dead ends: 53 [2024-11-13 13:52:43,224 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 13:52:43,225 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 64 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 133 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 13:52:43,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:52:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-13 13:52:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-13 13:52:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 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 13:52:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2024-11-13 13:52:43,239 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 17 [2024-11-13 13:52:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2024-11-13 13:52:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 13:52:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2024-11-13 13:52:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 13:52:43,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:43,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:52:43,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:52:43,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1800615860, now seen corresponding path program 1 times [2024-11-13 13:52:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:52:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828224351] [2024-11-13 13:52:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:52:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:52:43,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:52:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:52:43,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:52:43,374 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:52:43,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:52:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:52:43,381 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 13:52:43,423 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:52:43,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:52:43 BoogieIcfgContainer [2024-11-13 13:52:43,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:52:43,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:52:43,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:52:43,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:52:43,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:52:41" (3/4) ... [2024-11-13 13:52:43,475 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:52:43,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:52:43,477 INFO L158 Benchmark]: Toolchain (without parser) took 3579.29ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 131.3MB in the end (delta: -2.4MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-11-13 13:52:43,477 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:52:43,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.88ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 113.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:52:43,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.28ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 107.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:52:43,478 INFO L158 Benchmark]: Boogie Preprocessor took 75.85ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:52:43,479 INFO L158 Benchmark]: RCFGBuilder took 1057.41ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 67.7MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 13:52:43,479 INFO L158 Benchmark]: TraceAbstraction took 1904.81ms. Allocated memory is still 167.8MB. Free memory was 67.1MB in the beginning and 47.7MB in the end (delta: 19.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-13 13:52:43,479 INFO L158 Benchmark]: Witness Printer took 45.21ms. Allocated memory is still 167.8MB. Free memory was 47.7MB in the beginning and 131.3MB in the end (delta: -83.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:52:43,484 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.44ms. Allocated memory is still 167.8MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.88ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 113.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.28ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 107.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.85ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.41ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 67.7MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1904.81ms. Allocated memory is still 167.8MB. Free memory was 67.1MB in the beginning and 47.7MB in the end (delta: 19.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 45.21ms. Allocated memory is still 167.8MB. Free memory was 47.7MB in the beginning and 131.3MB in the end (delta: -83.5MB). 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 75. 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 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 2); [L33] const SORT_16 msb_SORT_16 = (SORT_16)1 << (2 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 32); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (32 - 1); [L38] const SORT_4 var_5 = 0; [L39] const SORT_4 var_8 = 255; [L40] const SORT_1 var_12 = 1; [L41] const SORT_16 var_17 = 0; [L42] const SORT_4 var_21 = 1; [L43] const SORT_4 var_23 = 63; [L44] const SORT_4 var_29 = 7; [L45] const SORT_16 var_35 = 2; [L46] const SORT_16 var_38 = 1; [L47] const SORT_44 var_45 = 0; [L48] const SORT_44 var_46 = 1; [L49] const SORT_44 var_52 = 2; [L51] SORT_1 input_2; [L52] SORT_1 input_3; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, var_12=1, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L54] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, var_12=1, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L55] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L57] SORT_4 init_7_arg_1 = var_5; [L58] state_6 = init_7_arg_1 [L59] SORT_16 init_19_arg_1 = var_17; [L60] state_18 = init_19_arg_1 VAL [mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, state_18=0, state_6=0, var_12=1, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L63] input_2 = __VERIFIER_nondet_uchar() [L64] input_3 = __VERIFIER_nondet_uchar() [L65] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, state_18=0, state_6=0, var_12=1, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L65] input_3 = input_3 & mask_SORT_1 [L68] SORT_4 var_9_arg_0 = state_6; [L69] SORT_4 var_9_arg_1 = var_8; [L70] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L71] SORT_1 var_13_arg_0 = var_9; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_14_arg_0 = var_12; [L74] SORT_1 var_14_arg_1 = var_13; VAL [input_3=0, mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, state_18=0, state_6=0, var_12=1, var_14_arg_0=1, var_14_arg_1=-2, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L75] EXPR var_14_arg_0 & var_14_arg_1 VAL [input_3=0, mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, state_18=0, state_6=0, var_12=1, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L75] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L76] EXPR var_14 & mask_SORT_1 VAL [input_3=0, mask_SORT_16=3, mask_SORT_1=1, mask_SORT_4=255, state_18=0, state_6=0, var_12=1, var_17=0, var_21=1, var_23=63, var_29=7, var_35=2, var_38=1, var_45=0, var_46=1, var_52=2, var_5=0, var_8=255] [L76] var_14 = var_14 & mask_SORT_1 [L77] SORT_1 bad_15_arg_0 = var_14; [L78] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 334 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 209 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=55occurred 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, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 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 13:52:43,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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 54eceae7382bc15f3f6868c637e60b7eb166af5d1c4b040a6f157b03b87c995c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:52:46,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:52:46,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-13 13:52:46,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:52:46,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:52:46,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:52:46,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:52:46,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:52:46,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:52:46,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:52:46,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:52:46,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:52:46,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:52:46,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:52:46,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:52:46,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:52:46,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:52:46,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:52:46,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:52:46,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:52:46,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:52:46,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:52:46,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:52:46,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:52:46,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:52:46,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:52:46,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:52:46,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:52:46,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:52:46,961 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:52:46,961 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:52:46,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:52:46,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:52:46,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:52:46,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:52:46,961 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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/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 -> 54eceae7382bc15f3f6868c637e60b7eb166af5d1c4b040a6f157b03b87c995c [2024-11-13 13:52:47,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:52:47,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:52:47,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:52:47,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:52:47,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:52:47,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c Unable to find full path for "g++" [2024-11-13 13:52:49,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:52:49,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:52:49,992 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c [2024-11-13 13:52:50,008 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data/a25d4cfac/2c9a53ef55b14ab781831f9950ff1d29/FLAG4d10ab7fb [2024-11-13 13:52:50,036 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/data/a25d4cfac/2c9a53ef55b14ab781831f9950ff1d29 [2024-11-13 13:52:50,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:52:50,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:52:50,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:52:50,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:52:50,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:52:50,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7881d6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50, skipping insertion in model container [2024-11-13 13:52:50,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:52:50,283 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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c[1263,1276] [2024-11-13 13:52:50,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:52:50,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:52:50,449 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_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_traffic_light_example.c[1263,1276] [2024-11-13 13:52:50,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:52:50,555 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:52:50,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50 WrapperNode [2024-11-13 13:52:50,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:52:50,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:52:50,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:52:50,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:52:50,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,614 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-11-13 13:52:50,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:52:50,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:52:50,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:52:50,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:52:50,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,657 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 13:52:50,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:52:50,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:52:50,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:52:50,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:52:50,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (1/1) ... [2024-11-13 13:52:50,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:52:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:52:50,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:52:50,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:52:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:52:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:52:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:52:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:52:50,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:52:50,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:52:51,454 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-13 13:52:51,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:52:51,465 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:52:51,466 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:52:51,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:52:51 BoogieIcfgContainer [2024-11-13 13:52:51,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:52:51,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:52:51,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:52:51,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:52:51,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:52:50" (1/3) ... [2024-11-13 13:52:51,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fed1f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:52:51, skipping insertion in model container [2024-11-13 13:52:51,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:52:50" (2/3) ... [2024-11-13 13:52:51,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fed1f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:52:51, skipping insertion in model container [2024-11-13 13:52:51,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:52:51" (3/3) ... [2024-11-13 13:52:51,478 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_traffic_light_example.c [2024-11-13 13:52:51,499 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:52:51,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_traffic_light_example.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:52:51,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:52:51,594 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;@7b2a3909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:52:51,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:52:51,601 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 13:52:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:52:51,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:51,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:52:51,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:51,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-13 13:52:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:52:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308371348] [2024-11-13 13:52:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:51,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:52:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:52:51,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:52:51,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:52:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:51,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 13:52:51,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:52:52,249 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 13:52:52,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:52:52,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:52:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308371348] [2024-11-13 13:52:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308371348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:52:52,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:52:52,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:52:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858599039] [2024-11-13 13:52:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:52:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:52:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:52:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:52:52,292 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 13:52:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:52,394 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-13 13:52:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:52:52,397 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 13:52:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:52,405 INFO L225 Difference]: With dead ends: 18 [2024-11-13 13:52:52,405 INFO L226 Difference]: Without dead ends: 10 [2024-11-13 13:52:52,408 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 13:52:52,414 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 13:52:52,417 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 13:52:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-13 13:52:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-13 13:52:52,446 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 13:52:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-13 13:52:52,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-13 13:52:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:52,457 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-13 13:52:52,457 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 13:52:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-13 13:52:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 13:52:52,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:52,458 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-13 13:52:52,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:52:52,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:52:52,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-13 13:52:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:52:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20155152] [2024-11-13 13:52:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:52,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:52:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:52:52,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:52:52,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:52:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:52,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:52:52,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:52:54,780 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 13:52:54,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:53:25,710 WARN L286 SmtUtils]: Spent 18.57s on a formula simplification that was a NOOP. DAG size: 284 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:54:04,920 WARN L286 SmtUtils]: Spent 18.33s on a formula simplification that was a NOOP. DAG size: 288 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:54:24,301 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 13:54:24,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:54:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20155152] [2024-11-13 13:54:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20155152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:54:24,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:54:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-13 13:54:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778406462] [2024-11-13 13:54:24,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:54:24,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:54:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:54:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:54:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2024-11-13 13:54:24,305 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 13:54:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:54:25,790 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-13 13:54:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:54:25,791 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 13:54:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:54:25,792 INFO L225 Difference]: With dead ends: 15 [2024-11-13 13:54:25,792 INFO L226 Difference]: Without dead ends: 13 [2024-11-13 13:54:25,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=46, Invalid=85, Unknown=1, NotChecked=0, Total=132 [2024-11-13 13:54:25,793 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:54:25,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:54:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-13 13:54:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-13 13:54:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:54:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-13 13:54:25,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-13 13:54:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:54:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-13 13:54:25,799 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 13:54:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-13 13:54:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:54:25,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:54:25,800 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-13 13:54:25,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:54:26,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:54:26,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:54:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-13 13:54:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:54:26,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571908969] [2024-11-13 13:54:26,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:54:26,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:54:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:54:26,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:54:26,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:54:26,158 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:54:26,158 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:54:26,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 13:54:26,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:54:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:54:38,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:18,236 WARN L286 SmtUtils]: Spent 9.63s on a formula simplification that was a NOOP. DAG size: 194 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:55:39,325 WARN L286 SmtUtils]: Spent 10.49s on a formula simplification that was a NOOP. DAG size: 198 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:56:14,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|)) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)) (.cse59 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse68 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|))) (let ((.cse12 (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse68)))))))) (.cse40 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse69 .cse9) (= .cse69 .cse10))))) (.cse32 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|) .cse9))) (.cse11 (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse68)))))))) (.cse67 ((_ zero_extend 24) ((_ extract 7 0) .cse9)))) (let ((.cse15 (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) .cse67))))))) (.cse62 (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_21~0#1|))) (.cse64 (and (or .cse12 .cse40) (or .cse32 .cse11))) (.cse19 (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) .cse67))))))) (let ((.cse1 (or .cse64 .cse19)) (.cse5 (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse62 .cse66))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|)))) .cse10) (= .cse66 .cse9)))) .cse11)) (.cse6 (or .cse12 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse62 .cse65))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|)))) .cse10) (= .cse65 .cse9) (= .cse65 .cse10)))))) (.cse47 (or .cse15 .cse64)) (.cse49 (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse63 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse63 .cse9) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse62 .cse63))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|)))) .cse10)) (= .cse63 .cse10)))) .cse12)) (.cse51 (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse61 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse61 .cse9) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse62 .cse61))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|)))) .cse10))))) .cse11)) (.cse60 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_23~0#1|))))))))))) (let ((.cse7 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse59 (_ bv1 32))))) (.cse18 (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) .cse60)))))) (.cse16 (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) .cse60))))))) (.cse24 (and .cse47 .cse49 .cse51)) (.cse17 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_17|)))))) (_ bv0 8)))) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_17|))))))))) (.cse23 (and .cse1 .cse5 .cse6)) (.cse36 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse58 .cse9)) (= .cse58 .cse10))))) (.cse26 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|) .cse9))))) (let ((.cse29 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse57 .cse9)) (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse57))))))))) .cse10)))))) (.cse31 (or .cse19 .cse26)) (.cse37 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= .cse56 .cse9)) (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse56))))))))) .cse10)) (= .cse56 .cse10))))) (.cse38 (or .cse36 .cse19)) (.cse41 (or .cse12 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse55 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse55))))))))) .cse10)) (not (= .cse55 .cse9)) (= .cse55 .cse10)))))) (.cse42 (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse54))))))))) .cse10)) (not (= .cse54 .cse9))))) .cse11)) (.cse21 (or .cse0 .cse23)) (.cse22 (or .cse24 .cse17)) (.cse44 (and .cse15 .cse16)) (.cse43 (and .cse18 .cse19)) (.cse20 (and (or .cse36 .cse12) (or .cse11 .cse26))) (.cse33 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse53))))))))) .cse10))) (= .cse53 .cse9) (= .cse53 .cse10))))) (.cse34 (or .cse40 .cse15)) (.cse25 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse52))))))))) .cse10))) (= .cse52 .cse9))))) (.cse27 (or .cse15 .cse32)) (.cse4 (not .cse7))) (and (or .cse0 (let ((.cse2 (or .cse12 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse13 .cse9) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse13))))))))) .cse10) (= .cse13 .cse10)))))) (.cse3 (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse8 .cse9) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse8))))))))) .cse10)))) .cse11))) (and (or (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 .cse5 .cse6 .cse3) .cse7)))) (or (and (or (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_29~0#1|))))))))))) (and (or (and (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|))))))) .cse15 .cse16) .cse17) (or (and (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|)))))) .cse18 .cse19) .cse0))) .cse20) .cse21 .cse22) .cse7) (or .cse0 (and (or .cse4 .cse23) (or .cse23 .cse7))) (or (and (or .cse24 .cse4) (or .cse24 .cse7)) .cse17) (or (and (or (and (or (and .cse25 (or .cse15 .cse26) .cse27 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse28))))))))) .cse10))) (not (= .cse28 .cse9)))))) .cse17) (or .cse0 (and .cse29 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse30 .cse9) (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse30))))))))) .cse10))))) .cse31 (or .cse32 .cse19)))) .cse11) (or .cse12 (and (or .cse17 (and .cse33 .cse34 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse35))))))))) .cse10))) (not (= .cse35 .cse9)) (= .cse35 .cse10)))) (or .cse36 .cse15))) (or (and .cse37 .cse38 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= .cse39 .cse9) (forall ((|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse39))))))))) .cse10)) (= .cse39 .cse10)))) (or .cse40 .cse19)) .cse0)))) .cse4) (or (and (or .cse0 (and (or (and .cse29 (or .cse18 .cse26) .cse31) .cse11) (or (and .cse37 .cse38 (or .cse36 .cse18)) .cse12))) (or .cse17 (and .cse41 (or .cse20 .cse16) .cse42 (or .cse15 .cse20)))) .cse7) (or (and (or (and (or .cse43 .cse7) (or .cse43 .cse4)) .cse0) (or (and (or .cse44 .cse7) (or .cse44 .cse4)) .cse17)) .cse20) (or .cse4 (and (or .cse15 .cse17 .cse20) (or (and (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse45))))))))) .cse10) (not (= .cse45 .cse9))))) .cse11) (or .cse12 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse46))))))))) .cse10) (not (= .cse46 .cse9)) (= .cse46 .cse10)))))) .cse0) (or .cse0 .cse20 .cse19) (or .cse17 (and .cse41 .cse42)))) (or (and .cse21 .cse22 (or (and (or .cse17 .cse44) (or .cse43 .cse0)) .cse20)) .cse4) (or (and (or (and (or .cse12 (and .cse33 .cse34)) (or (and .cse25 .cse27) .cse11)) .cse4) (or (and .cse47 (or .cse12 (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse48))))))))) .cse10)) (= .cse48 .cse9) (= .cse48 .cse10))))) .cse49 (or (forall ((|ULTIMATE.start_main_~state_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_4~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_4~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse50))))))))) .cse10)) (= .cse50 .cse9)))) .cse11) .cse51) .cse7)) .cse17)))))))) is different from false [2024-11-13 13:57:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-13 13:57:46,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:57:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571908969] [2024-11-13 13:57:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571908969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:46,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:57:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-13 13:57:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122973503] [2024-11-13 13:57:46,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:46,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:57:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:57:46,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:57:46,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=81, Unknown=3, NotChecked=18, Total=132 [2024-11-13 13:57:46,742 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 13:57:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:50,571 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-13 13:57:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:57:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 11 [2024-11-13 13:57:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:50,572 INFO L225 Difference]: With dead ends: 12 [2024-11-13 13:57:50,573 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 13:57:50,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=50, Invalid=107, Unknown=3, NotChecked=22, Total=182 [2024-11-13 13:57:50,574 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:50,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:57:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 13:57:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 13:57:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 13:57:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 13:57:50,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-13 13:57:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:50,576 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 13:57:50,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 13:57:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 13:57:50,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 13:57:50,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:57:50,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 13:57:50,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:50,784 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-13 13:57:50,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 13:57:53,603 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:57:53,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:57:53 BoogieIcfgContainer [2024-11-13 13:57:53,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:57:53,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:57:53,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:57:53,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:57:53,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:52:51" (3/4) ... [2024-11-13 13:57:53,631 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 13:57:53,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-13 13:57:53,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 13:57:53,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 13:57:53,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 13:57:53,682 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException: Cannot invoke "org.eclipse.cdt.core.dom.ast.IASTNode.getRawSignature()" because "" is null at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:156) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GraphMLCorrectnessWitnessGenerator.lambda$2(GraphMLCorrectnessWitnessGenerator.java:91) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GraphMLCorrectnessWitnessGenerator.makeGraphMLString(GraphMLCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:168) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:143) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-13 13:57:53,689 INFO L158 Benchmark]: Toolchain (without parser) took 303648.41ms. Allocated memory was 83.9MB in the beginning and 578.8MB in the end (delta: 494.9MB). Free memory was 60.0MB in the beginning and 542.2MB in the end (delta: -482.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-13 13:57:53,689 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 83.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:57:53,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.87ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 44.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:57:53,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.78ms. Allocated memory is still 83.9MB. Free memory was 44.6MB in the beginning and 42.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:57:53,690 INFO L158 Benchmark]: Boogie Preprocessor took 79.80ms. Allocated memory is still 83.9MB. Free memory was 42.5MB in the beginning and 40.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:57:53,690 INFO L158 Benchmark]: RCFGBuilder took 770.52ms. Allocated memory is still 83.9MB. Free memory was 40.0MB in the beginning and 54.4MB in the end (delta: -14.4MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-13 13:57:53,695 INFO L158 Benchmark]: TraceAbstraction took 302152.58ms. Allocated memory was 83.9MB in the beginning and 578.8MB in the end (delta: 494.9MB). Free memory was 53.9MB in the beginning and 546.2MB in the end (delta: -492.4MB). Peak memory consumption was 339.8MB. Max. memory is 16.1GB. [2024-11-13 13:57:53,695 INFO L158 Benchmark]: Witness Printer took 62.43ms. Allocated memory is still 578.8MB. Free memory was 546.2MB in the beginning and 542.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:57:53,697 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.50ms. Allocated memory is still 83.9MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.87ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 44.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.78ms. Allocated memory is still 83.9MB. Free memory was 44.6MB in the beginning and 42.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.80ms. Allocated memory is still 83.9MB. Free memory was 42.5MB in the beginning and 40.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 770.52ms. Allocated memory is still 83.9MB. Free memory was 40.0MB in the beginning and 54.4MB in the end (delta: -14.4MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 302152.58ms. Allocated memory was 83.9MB in the beginning and 578.8MB in the end (delta: 494.9MB). Free memory was 53.9MB in the beginning and 546.2MB in the end (delta: -492.4MB). Peak memory consumption was 339.8MB. Max. memory is 16.1GB. * Witness Printer took 62.43ms. Allocated memory is still 578.8MB. Free memory was 546.2MB in the beginning and 542.2MB in the end (delta: 4.1MB). 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 299.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 10 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 87.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 292.4s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 13 QuantifiedInterpolants, 32893 SizeOfPredicates, 38 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((63 == var_23) && (((1 + var_8) % 256) == 0)) && (state_6 != 255)) && (7 == var_29)) && (1 == var_12)) && (1 == mask_SORT_1)) && (0 == var_5)) && (1 == var_21)) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: Cannot invoke "org.eclipse.cdt.core.dom.ast.IASTNode.getRawSignature()" because "" is null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: Cannot invoke "org.eclipse.cdt.core.dom.ast.IASTNode.getRawSignature()" because "" is null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:80) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-13 13:57:53,911 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 13:57:54,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f79d563d-05b2-4e6d-b1b2-5869833bcc9c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: Cannot invoke "org.eclipse.cdt.core.dom.ast.IASTNode.getRawSignature()" because "" is null