./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme --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 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:50:12,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:50:12,548 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-26 10:50:12,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:50:12,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:50:12,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:50:12,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:50:12,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:50:12,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:50:12,611 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:50:12,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:50:12,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:50:12,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:50:12,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:50:12,614 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:50:12,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:50:12,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:50:12,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:50:12,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:50:12,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:50:12,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:50:12,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:50:12,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:50:12,621 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:50:12,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:50:12,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:50:12,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:50:12,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:50:12,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:12,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:50:12,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:50:12,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:50:12,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:50:12,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:50:12,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:50:12,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:50:12,635 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:50:12,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:50:12,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:50:12,636 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme 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 -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2023-11-26 10:50:12,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:50:13,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:50:13,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:50:13,012 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:50:13,013 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:50:13,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2023-11-26 10:50:16,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:50:16,474 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:50:16,474 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2023-11-26 10:50:16,482 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data/12e263bc3/82d966a406c044e0bcb78dbf8a6affae/FLAGea845604b [2023-11-26 10:50:16,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data/12e263bc3/82d966a406c044e0bcb78dbf8a6affae [2023-11-26 10:50:16,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:50:16,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:50:16,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:16,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:50:16,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:50:16,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eda4ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16, skipping insertion in model container [2023-11-26 10:50:16,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,538 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:50:16,698 WARN L240 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_ac18c1b2-36a1-40c7-af2a-e4931121084d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2023-11-26 10:50:16,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:16,751 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:50:16,763 WARN L240 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_ac18c1b2-36a1-40c7-af2a-e4931121084d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2023-11-26 10:50:16,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:16,819 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:50:16,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16 WrapperNode [2023-11-26 10:50:16,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:16,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:16,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:50:16,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:50:16,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,899 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 162 [2023-11-26 10:50:16,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:16,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:50:16,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:50:16,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:50:16,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,937 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]. [2023-11-26 10:50:16,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:50:16,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:50:16,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:50:16,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:50:16,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:16,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:17,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:50:17,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:50:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:50:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:50:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:50:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:50:17,157 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:50:17,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:50:17,611 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:50:17,667 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:50:17,668 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:50:17,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:17 BoogieIcfgContainer [2023-11-26 10:50:17,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:50:17,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:50:17,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:50:17,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:50:17,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:50:16" (1/3) ... [2023-11-26 10:50:17,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496c0986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:17, skipping insertion in model container [2023-11-26 10:50:17,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (2/3) ... [2023-11-26 10:50:17,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496c0986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:17, skipping insertion in model container [2023-11-26 10:50:17,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:17" (3/3) ... [2023-11-26 10:50:17,683 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2023-11-26 10:50:17,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:50:17,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:50:17,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:50:17,759 INFO L357 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, mHoare=true, 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;@531251cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:50:17,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:50:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 10:50:17,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:17,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:17,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:17,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1310705114, now seen corresponding path program 1 times [2023-11-26 10:50:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536606390] [2023-11-26 10:50:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536606390] [2023-11-26 10:50:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536606390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:50:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98283964] [2023-11-26 10:50:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:18,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:50:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:18,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:50:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:50:18,465 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-11-26 10:50:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:18,515 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2023-11-26 10:50:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:50:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) Word has length 12 [2023-11-26 10:50:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:18,527 INFO L225 Difference]: With dead ends: 57 [2023-11-26 10:50:18,528 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 10:50:18,531 INFO L412 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 [2023-11-26 10:50:18,535 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:18,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 10:50:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-26 10:50:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2023-11-26 10:50:18,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 12 [2023-11-26 10:50:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:18,580 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2023-11-26 10:50:18,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-11-26 10:50:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2023-11-26 10:50:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 10:50:18,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:18,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:18,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:50:18,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:18,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1975427874, now seen corresponding path program 1 times [2023-11-26 10:50:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018365945] [2023-11-26 10:50:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018365945] [2023-11-26 10:50:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018365945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:18,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:50:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390377040] [2023-11-26 10:50:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:18,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:50:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:50:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:50:18,788 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:18,840 INFO L93 Difference]: Finished difference Result 60 states and 89 transitions. [2023-11-26 10:50:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:50:18,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-26 10:50:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:18,845 INFO L225 Difference]: With dead ends: 60 [2023-11-26 10:50:18,846 INFO L226 Difference]: Without dead ends: 35 [2023-11-26 10:50:18,846 INFO L412 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 [2023-11-26 10:50:18,848 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 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 [2023-11-26 10:50:18,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-26 10:50:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-11-26 10:50:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2023-11-26 10:50:18,861 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 13 [2023-11-26 10:50:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-11-26 10:50:18,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2023-11-26 10:50:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-26 10:50:18,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:18,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:18,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:50:18,863 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:18,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1319154368, now seen corresponding path program 1 times [2023-11-26 10:50:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:18,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538042909] [2023-11-26 10:50:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538042909] [2023-11-26 10:50:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538042909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:19,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:19,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:50:19,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429875224] [2023-11-26 10:50:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:50:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:50:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:50:19,156 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2023-11-26 10:50:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:19,222 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2023-11-26 10:50:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:50:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-26 10:50:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:19,225 INFO L225 Difference]: With dead ends: 62 [2023-11-26 10:50:19,225 INFO L226 Difference]: Without dead ends: 35 [2023-11-26 10:50:19,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:19,232 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:19,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-26 10:50:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-11-26 10:50:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2023-11-26 10:50:19,255 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 14 [2023-11-26 10:50:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:19,255 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2023-11-26 10:50:19,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2023-11-26 10:50:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2023-11-26 10:50:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-26 10:50:19,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:19,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:19,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:50:19,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:19,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 455852994, now seen corresponding path program 1 times [2023-11-26 10:50:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040370436] [2023-11-26 10:50:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:19,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:19,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:50:19,354 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:50:19,356 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:50:19,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:50:19,361 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 10:50:19,367 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:50:19,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 10:50:19,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 10:50:19,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-26 10:50:19,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-26 10:50:19,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-26 10:50:19,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-26 10:50:19,410 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:19,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:50:19 BoogieIcfgContainer [2023-11-26 10:50:19,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:50:19,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:50:19,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:50:19,427 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:50:19,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:17" (3/4) ... [2023-11-26 10:50:19,430 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:50:19,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:50:19,432 INFO L158 Benchmark]: Toolchain (without parser) took 2930.84ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 86.2MB in the beginning and 122.9MB in the end (delta: -36.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:19,433 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 127.9MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:19,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.71ms. Allocated memory is still 127.9MB. Free memory was 86.2MB in the beginning and 74.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:50:19,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.81ms. Allocated memory is still 127.9MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:19,434 INFO L158 Benchmark]: Boogie Preprocessor took 65.95ms. Allocated memory is still 127.9MB. Free memory was 70.4MB in the beginning and 67.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:50:19,434 INFO L158 Benchmark]: RCFGBuilder took 701.93ms. Allocated memory is still 127.9MB. Free memory was 67.4MB in the beginning and 46.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 10:50:19,434 INFO L158 Benchmark]: TraceAbstraction took 1754.55ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 45.6MB in the beginning and 124.0MB in the end (delta: -78.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:19,435 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 161.5MB. Free memory was 124.0MB in the beginning and 122.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:19,438 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.37ms. Allocated memory is still 127.9MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.71ms. Allocated memory is still 127.9MB. Free memory was 86.2MB in the beginning and 74.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.81ms. Allocated memory is still 127.9MB. Free memory was 74.1MB in the beginning and 70.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.95ms. Allocated memory is still 127.9MB. Free memory was 70.4MB in the beginning and 67.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 701.93ms. Allocated memory is still 127.9MB. Free memory was 67.4MB in the beginning and 46.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1754.55ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 45.6MB in the beginning and 124.0MB in the end (delta: -78.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 161.5MB. Free memory was 124.0MB in the beginning and 122.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 63. 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 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, var_14=1, var_21=2, var_5=0, var_8=6] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, var_14=1, var_21=2, var_5=0, var_8=6] [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, state_9=6, var_14=1, var_21=2, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, state_9=6, var_11=1, var_11_arg_0=0, var_11_arg_1=6, var_14=1, var_15=254, var_15_arg_0=1, var_16_arg_0=1, var_16_arg_1=254, var_21=2, var_5=0, var_8=6] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, state_9=6, var_11=1, var_11_arg_0=0, var_11_arg_1=6, var_14=1, var_15=254, var_15_arg_0=1, var_16_arg_0=1, var_16_arg_1=254, var_21=2, var_5=0, var_8=6] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 VAL [init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, state_9=6, var_11=1, var_11_arg_0=0, var_11_arg_1=6, var_14=1, var_15=254, var_15_arg_0=1, var_16=1, var_16_arg_0=1, var_16_arg_1=254, var_21=2, var_5=0, var_8=6] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 126 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 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 [2023-11-26 10:50:19,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme --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 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:50:22,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:50:22,406 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-26 10:50:22,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:50:22,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:50:22,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:50:22,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:50:22,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:50:22,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:50:22,475 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:50:22,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:50:22,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:50:22,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:50:22,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:50:22,480 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:50:22,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:50:22,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:50:22,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:50:22,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:50:22,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:50:22,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:50:22,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:50:22,485 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 10:50:22,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 10:50:22,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:50:22,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:50:22,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:50:22,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:50:22,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:50:22,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:50:22,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:22,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:50:22,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:50:22,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:50:22,493 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 10:50:22,493 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 10:50:22,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:50:22,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:50:22,495 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:50:22,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:50:22,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:50:22,497 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 10:50:22,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme 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 -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2023-11-26 10:50:22,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:50:23,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:50:23,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:50:23,013 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:50:23,014 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:50:23,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2023-11-26 10:50:26,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:50:26,614 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:50:26,615 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2023-11-26 10:50:26,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data/7e1c96c23/cc6c13927d3948528ce8e4cb21b630b4/FLAGf0ce5a36b [2023-11-26 10:50:26,636 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/data/7e1c96c23/cc6c13927d3948528ce8e4cb21b630b4 [2023-11-26 10:50:26,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:50:26,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:50:26,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:26,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:50:26,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:50:26,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:26,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7ca584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26, skipping insertion in model container [2023-11-26 10:50:26,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:26,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:50:26,834 WARN L240 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_ac18c1b2-36a1-40c7-af2a-e4931121084d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2023-11-26 10:50:26,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:26,884 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:50:26,898 WARN L240 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_ac18c1b2-36a1-40c7-af2a-e4931121084d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c[1247,1260] [2023-11-26 10:50:26,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:26,947 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:50:26,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26 WrapperNode [2023-11-26 10:50:26,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:26,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:26,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:50:26,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:50:26,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:26,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:26,992 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-11-26 10:50:26,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:26,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:50:26,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:50:26,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:50:27,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,025 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]. [2023-11-26 10:50:27,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:50:27,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:50:27,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:50:27,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:50:27,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (1/1) ... [2023-11-26 10:50:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:27,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:27,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:50:27,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:50:27,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 10:50:27,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:50:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:50:27,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:50:27,315 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:50:27,317 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:50:27,556 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:50:27,619 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:50:27,620 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:50:27,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:27 BoogieIcfgContainer [2023-11-26 10:50:27,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:50:27,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:50:27,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:50:27,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:50:27,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:50:26" (1/3) ... [2023-11-26 10:50:27,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48daea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:27, skipping insertion in model container [2023-11-26 10:50:27,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:26" (2/3) ... [2023-11-26 10:50:27,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48daea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:27, skipping insertion in model container [2023-11-26 10:50:27,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:27" (3/3) ... [2023-11-26 10:50:27,636 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2023-11-26 10:50:27,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:50:27,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:50:27,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:50:27,748 INFO L357 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, mHoare=true, 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;@47e639ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:50:27,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:50:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-26 10:50:27,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:27,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-26 10:50:27,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:27,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-11-26 10:50:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:50:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852063082] [2023-11-26 10:50:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:27,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:27,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:50:27,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 10:50:27,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 10:50:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-26 10:50:27,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:28,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:28,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:50:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852063082] [2023-11-26 10:50:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852063082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:28,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:50:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256264526] [2023-11-26 10:50:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:28,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:50:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:50:28,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:50:28,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:50:28,266 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-11-26 10:50:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:28,336 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-11-26 10:50:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:50:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-26 10:50:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:28,347 INFO L225 Difference]: With dead ends: 16 [2023-11-26 10:50:28,347 INFO L226 Difference]: Without dead ends: 9 [2023-11-26 10:50:28,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:28,355 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 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 [2023-11-26 10:50:28,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-26 10:50:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-11-26 10:50:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2023-11-26 10:50:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-26 10:50:28,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-11-26 10:50:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:28,392 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-26 10:50:28,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-11-26 10:50:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-26 10:50:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-26 10:50:28,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:28,393 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-26 10:50:28,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:28,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:28,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:28,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-11-26 10:50:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:50:28,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972621940] [2023-11-26 10:50:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:28,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:50:28,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 10:50:28,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 10:50:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,695 WARN L260 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-26 10:50:28,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:29,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:29,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:50:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972621940] [2023-11-26 10:50:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972621940] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:29,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:50:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-26 10:50:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555467940] [2023-11-26 10:50:29,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:29,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:50:29,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:50:29,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:50:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:50:29,526 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:29,803 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-11-26 10:50:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:50:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-26 10:50:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:29,804 INFO L225 Difference]: With dead ends: 17 [2023-11-26 10:50:29,805 INFO L226 Difference]: Without dead ends: 15 [2023-11-26 10:50:29,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:50:29,807 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:29,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-26 10:50:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-26 10:50:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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) [2023-11-26 10:50:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-11-26 10:50:29,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-11-26 10:50:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:29,815 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-11-26 10:50:29,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-11-26 10:50:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 10:50:29,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:29,816 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-11-26 10:50:29,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-26 10:50:30,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:30,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:30,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-11-26 10:50:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:50:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437815559] [2023-11-26 10:50:30,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 10:50:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:50:30,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 10:50:30,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 10:50:30,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 10:50:30,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:50:30,161 WARN L260 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-26 10:50:30,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:30,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:31,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:50:31,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437815559] [2023-11-26 10:50:31,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437815559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:31,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:50:31,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-26 10:50:31,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585706970] [2023-11-26 10:50:31,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:31,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 10:50:31,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:50:31,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 10:50:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:50:31,547 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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) [2023-11-26 10:50:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:32,627 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-26 10:50:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 10:50:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-26 10:50:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:32,628 INFO L225 Difference]: With dead ends: 29 [2023-11-26 10:50:32,628 INFO L226 Difference]: Without dead ends: 27 [2023-11-26 10:50:32,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-11-26 10:50:32,630 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:32,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-26 10:50:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-26 10:50:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-11-26 10:50:32,640 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2023-11-26 10:50:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:32,641 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-11-26 10:50:32,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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) [2023-11-26 10:50:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-11-26 10:50:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-26 10:50:32,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:32,642 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2023-11-26 10:50:32,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:32,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:32,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:32,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 284396189, now seen corresponding path program 3 times [2023-11-26 10:50:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:50:32,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064558252] [2023-11-26 10:50:32,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 10:50:32,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:32,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:50:32,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 10:50:32,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 10:50:33,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-26 10:50:33,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:50:33,052 WARN L260 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 146 conjunts are in the unsatisfiable core [2023-11-26 10:50:33,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:34,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:36,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:50:36,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064558252] [2023-11-26 10:50:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064558252] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:36,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:50:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-11-26 10:50:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371247669] [2023-11-26 10:50:36,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-26 10:50:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:50:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-26 10:50:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-11-26 10:50:36,478 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:39,546 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-11-26 10:50:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-26 10:50:39,547 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-26 10:50:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:39,548 INFO L225 Difference]: With dead ends: 47 [2023-11-26 10:50:39,548 INFO L226 Difference]: Without dead ends: 45 [2023-11-26 10:50:39,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=392, Invalid=1014, Unknown=0, NotChecked=0, Total=1406 [2023-11-26 10:50:39,550 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:39,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 26 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 10:50:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-26 10:50:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2023-11-26 10:50:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2023-11-26 10:50:39,565 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 25 [2023-11-26 10:50:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:39,565 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2023-11-26 10:50:39,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:50:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2023-11-26 10:50:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-26 10:50:39,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:39,567 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1] [2023-11-26 10:50:39,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:39,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:39,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:39,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2052584739, now seen corresponding path program 4 times [2023-11-26 10:50:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:50:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687291516] [2023-11-26 10:50:39,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 10:50:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:50:39,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 10:50:39,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-26 10:50:40,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 10:50:40,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 10:50:40,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:40,363 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 10:50:40,363 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:50:40,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:50:40,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:40,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:50:40,577 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-11-26 10:50:40,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:50:40,661 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,661 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,667 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,667 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,667 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,667 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,667 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,667 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,668 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,668 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,668 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,668 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,668 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,668 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:50:40 BoogieIcfgContainer [2023-11-26 10:50:40,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:50:40,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:50:40,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:50:40,696 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:50:40,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:27" (3/4) ... [2023-11-26 10:50:40,697 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 10:50:40,722 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,722 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,723 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,724 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,724 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,724 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,724 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,724 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-26 10:50:40,847 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:50:40,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:50:40,848 INFO L158 Benchmark]: Toolchain (without parser) took 14207.90ms. Allocated memory was 104.9MB in the beginning and 245.4MB in the end (delta: 140.5MB). Free memory was 80.5MB in the beginning and 177.2MB in the end (delta: -96.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,848 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:40,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.68ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 68.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.20ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 66.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,850 INFO L158 Benchmark]: Boogie Preprocessor took 73.12ms. Allocated memory is still 104.9MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,850 INFO L158 Benchmark]: RCFGBuilder took 554.20ms. Allocated memory is still 104.9MB. Free memory was 64.2MB in the beginning and 50.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,850 INFO L158 Benchmark]: TraceAbstraction took 13069.85ms. Allocated memory was 104.9MB in the beginning and 245.4MB in the end (delta: 140.5MB). Free memory was 49.9MB in the beginning and 188.9MB in the end (delta: -139.1MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,851 INFO L158 Benchmark]: Witness Printer took 152.15ms. Allocated memory is still 245.4MB. Free memory was 188.9MB in the beginning and 177.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:50:40,854 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.33ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.68ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 68.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.20ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 66.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.12ms. Allocated memory is still 104.9MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.20ms. Allocated memory is still 104.9MB. Free memory was 64.2MB in the beginning and 50.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13069.85ms. Allocated memory was 104.9MB in the beginning and 245.4MB in the end (delta: 140.5MB). Free memory was 49.9MB in the beginning and 188.9MB in the end (delta: -139.1MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. * Witness Printer took 152.15ms. Allocated memory is still 245.4MB. Free memory was 188.9MB in the beginning and 177.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, state_6=0, state_9=6, var_14=1, var_21=2, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=2, next_28_arg_1=8, state_6=2, state_9=8, var_11=1, var_11_arg_0=0, var_11_arg_1=6, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=0, var_20_arg_0=0, var_21=2, var_22=2, var_22_arg_0=0, var_22_arg_1=2, var_23=2, var_23_arg_0=2, var_25=6, var_25_arg_0=6, var_26=8, var_26_arg_0=6, var_26_arg_1=2, var_27=8, var_27_arg_0=8, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=4, next_28_arg_1=10, state_6=4, state_9=10, var_11=1, var_11_arg_0=2, var_11_arg_1=8, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=2, var_20_arg_0=2, var_21=2, var_22=4, var_22_arg_0=2, var_22_arg_1=2, var_23=4, var_23_arg_0=4, var_25=8, var_25_arg_0=8, var_26=10, var_26_arg_0=8, var_26_arg_1=2, var_27=10, var_27_arg_0=10, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=6, next_28_arg_1=12, state_6=6, state_9=12, var_11=1, var_11_arg_0=4, var_11_arg_1=10, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=4, var_20_arg_0=4, var_21=2, var_22=6, var_22_arg_0=4, var_22_arg_1=2, var_23=6, var_23_arg_0=6, var_25=10, var_25_arg_0=10, var_26=12, var_26_arg_0=10, var_26_arg_1=2, var_27=12, var_27_arg_0=12, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=8, next_28_arg_1=14, state_6=8, state_9=14, var_11=1, var_11_arg_0=6, var_11_arg_1=12, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=6, var_20_arg_0=6, var_21=2, var_22=8, var_22_arg_0=6, var_22_arg_1=2, var_23=8, var_23_arg_0=8, var_25=12, var_25_arg_0=12, var_26=14, var_26_arg_0=12, var_26_arg_1=2, var_27=14, var_27_arg_0=14, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=10, next_28_arg_1=16, state_6=10, state_9=16, var_11=1, var_11_arg_0=8, var_11_arg_1=14, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=8, var_20_arg_0=8, var_21=2, var_22=10, var_22_arg_0=8, var_22_arg_1=2, var_23=10, var_23_arg_0=10, var_25=14, var_25_arg_0=14, var_26=16, var_26_arg_0=14, var_26_arg_1=2, var_27=16, var_27_arg_0=16, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=12, next_28_arg_1=18, state_6=12, state_9=18, var_11=1, var_11_arg_0=10, var_11_arg_1=16, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=10, var_20_arg_0=10, var_21=2, var_22=12, var_22_arg_0=10, var_22_arg_1=2, var_23=12, var_23_arg_0=12, var_25=16, var_25_arg_0=16, var_26=18, var_26_arg_0=16, var_26_arg_1=2, var_27=18, var_27_arg_0=18, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=14, next_28_arg_1=20, state_6=14, state_9=20, var_11=1, var_11_arg_0=12, var_11_arg_1=18, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=12, var_20_arg_0=12, var_21=2, var_22=14, var_22_arg_0=12, var_22_arg_1=2, var_23=14, var_23_arg_0=14, var_25=18, var_25_arg_0=18, var_26=20, var_26_arg_0=18, var_26_arg_1=2, var_27=20, var_27_arg_0=20, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=16, next_28_arg_1=22, state_6=16, state_9=22, var_11=1, var_11_arg_0=14, var_11_arg_1=20, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=14, var_20_arg_0=14, var_21=2, var_22=16, var_22_arg_0=14, var_22_arg_1=2, var_23=16, var_23_arg_0=16, var_25=20, var_25_arg_0=20, var_26=22, var_26_arg_0=20, var_26_arg_1=2, var_27=22, var_27_arg_0=22, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=18, next_28_arg_1=24, state_6=18, state_9=24, var_11=1, var_11_arg_0=16, var_11_arg_1=22, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=16, var_20_arg_0=16, var_21=2, var_22=18, var_22_arg_0=16, var_22_arg_1=2, var_23=18, var_23_arg_0=18, var_25=22, var_25_arg_0=22, var_26=24, var_26_arg_0=22, var_26_arg_1=2, var_27=24, var_27_arg_0=24, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=20, next_28_arg_1=26, state_6=20, state_9=26, var_11=1, var_11_arg_0=18, var_11_arg_1=24, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=18, var_20_arg_0=18, var_21=2, var_22=20, var_22_arg_0=18, var_22_arg_1=2, var_23=20, var_23_arg_0=20, var_25=24, var_25_arg_0=24, var_26=26, var_26_arg_0=24, var_26_arg_1=2, var_27=26, var_27_arg_0=26, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=22, next_28_arg_1=28, state_6=22, state_9=28, var_11=1, var_11_arg_0=20, var_11_arg_1=26, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=20, var_20_arg_0=20, var_21=2, var_22=22, var_22_arg_0=20, var_22_arg_1=2, var_23=22, var_23_arg_0=22, var_25=26, var_25_arg_0=26, var_26=28, var_26_arg_0=26, var_26_arg_1=2, var_27=28, var_27_arg_0=28, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=24, next_28_arg_1=30, state_6=24, state_9=30, var_11=1, var_11_arg_0=22, var_11_arg_1=28, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=22, var_20_arg_0=22, var_21=2, var_22=24, var_22_arg_0=22, var_22_arg_1=2, var_23=24, var_23_arg_0=24, var_25=28, var_25_arg_0=28, var_26=30, var_26_arg_0=28, var_26_arg_1=2, var_27=30, var_27_arg_0=30, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 VAL [bad_17_arg_0=0, init_10_arg_1=6, init_7_arg_1=0, mask_SORT_19=4294967295, mask_SORT_1=1, mask_SORT_4=31, msb_SORT_19=2147483648, msb_SORT_1=1, msb_SORT_4=16, next_24_arg_1=26, next_28_arg_1=0, state_6=26, state_9=0, var_11=1, var_11_arg_0=24, var_11_arg_1=30, var_14=1, var_15=254, var_15_arg_0=1, var_16=0, var_16_arg_0=1, var_16_arg_1=254, var_20=24, var_20_arg_0=24, var_21=2, var_22=26, var_22_arg_0=24, var_22_arg_1=2, var_23=26, var_23_arg_0=26, var_25=30, var_25_arg_0=30, var_26=32, var_26_arg_0=30, var_26_arg_1=2, var_27=0, var_27_arg_0=32, var_5=0, var_8=6] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 8 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, InterpolantAutomatonStates: 59, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 36 QuantifiedInterpolants, 7919 SizeOfPredicates, 250 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 10:50:40,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac18c1b2-36a1-40c7-af2a-e4931121084d/bin/uautomizer-verify-VRDe98Ueme/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE