./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:37:05,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:37:05,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:37:05,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:37:05,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:37:05,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:37:05,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:37:05,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:37:05,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:37:05,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:37:05,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:37:05,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:37:05,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:37:05,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:37:05,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:37:05,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:37:05,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:37:05,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:37:05,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:37:05,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:37:05,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:37:05,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:37:05,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:37:05,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:37:05,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:37:05,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:37:05,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:37:05,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:37:05,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:37:05,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:37:05,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:37:05,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:37:05,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:37:05,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:37:05,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:37:05,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:37:05,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:37:05,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:37:05,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:37:05,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:37:05,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:37:05,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 12:37:05,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:37:05,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:37:05,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:37:05,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:37:05,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:37:05,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:37:05,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:37:05,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:37:05,073 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:37:05,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:37:05,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:37:05,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:37:05,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:37:05,075 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:37:05,076 INFO L138 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 [2022-12-13 12:37:05,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:37:05,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:37:05,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:37:05,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:37:05,265 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:37:05,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-12-13 12:37:07,889 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:37:08,028 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:37:08,029 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-12-13 12:37:08,033 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data/dbd5797bf/6ea82f60f17d4aa7afa094484d898d21/FLAG0a5fe66d3 [2022-12-13 12:37:08,043 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data/dbd5797bf/6ea82f60f17d4aa7afa094484d898d21 [2022-12-13 12:37:08,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:37:08,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:37:08,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:37:08,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:37:08,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:37:08,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27734b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08, skipping insertion in model container [2022-12-13 12:37:08,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:37:08,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:37:08,151 WARN L237 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-12-13 12:37:08,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:37:08,173 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:37:08,180 WARN L237 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-12-13 12:37:08,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:37:08,197 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:37:08,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08 WrapperNode [2022-12-13 12:37:08,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:37:08,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:37:08,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:37:08,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:37:08,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,221 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-12-13 12:37:08,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:37:08,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:37:08,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:37:08,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:37:08,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,237 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:37:08,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:37:08,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:37:08,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:37:08,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (1/1) ... [2022-12-13 12:37:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:37:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:37:08,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:37:08,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:37:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:37:08,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:37:08,356 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:37:08,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:37:08,440 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:37:08,445 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:37:08,446 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:37:08,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:08 BoogieIcfgContainer [2022-12-13 12:37:08,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:37:08,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:37:08,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:37:08,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:37:08,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:37:08" (1/3) ... [2022-12-13 12:37:08,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b2e149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:08, skipping insertion in model container [2022-12-13 12:37:08,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:08" (2/3) ... [2022-12-13 12:37:08,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b2e149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:08, skipping insertion in model container [2022-12-13 12:37:08,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:08" (3/3) ... [2022-12-13 12:37:08,454 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2022-12-13 12:37:08,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:37:08,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:37:08,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:37:08,507 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=LoopsAndPotentialCycles, 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;@637d77e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:37:08,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:37:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) [2022-12-13 12:37:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 12:37:08,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:37:08,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:37:08,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:37:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-12-13 12:37:08,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:08,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014556250] [2022-12-13 12:37:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:37:08,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:37:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:37:08,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:37:08,664 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:37:08,665 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:37:08,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:37:08,670 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 12:37:08,674 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:37:08,682 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:37:08,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:37:08 BoogieIcfgContainer [2022-12-13 12:37:08,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:37:08,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:37:08,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:37:08,688 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:37:08,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:08" (3/4) ... [2022-12-13 12:37:08,690 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:37:08,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:37:08,691 INFO L158 Benchmark]: Toolchain (without parser) took 645.79ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 65.2MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-12-13 12:37:08,692 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:37:08,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.63ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 96.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:37:08,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.59ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:37:08,693 INFO L158 Benchmark]: Boogie Preprocessor took 17.21ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:37:08,693 INFO L158 Benchmark]: RCFGBuilder took 208.13ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 82.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 12:37:08,694 INFO L158 Benchmark]: TraceAbstraction took 238.19ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 65.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:37:08,694 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:37:08,696 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.63ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 96.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.59ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.21ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 208.13ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 82.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 238.19ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 65.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 53, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L31] const SORT_4 var_5 = 1; [L32] const SORT_4 var_8 = 15; [L33] const SORT_1 var_12 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L38] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L40] SORT_4 init_7_arg_1 = var_5; [L41] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_5=1, var_8=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2022-12-13 12:37:08,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:37:10,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:37:10,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:37:10,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:37:10,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:37:10,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:37:10,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:37:10,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:37:10,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:37:10,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:37:10,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:37:10,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:37:10,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:37:10,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:37:10,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:37:10,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:37:10,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:37:10,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:37:10,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:37:10,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:37:10,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:37:10,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:37:10,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:37:10,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:37:10,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:37:10,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:37:10,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:37:10,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:37:10,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:37:10,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:37:10,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:37:10,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:37:10,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:37:10,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:37:10,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:37:10,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:37:10,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:37:10,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:37:10,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:37:10,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:37:10,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:37:10,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-12-13 12:37:10,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:37:10,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:37:10,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:37:10,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:37:10,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:37:10,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:37:10,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:37:10,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:37:10,310 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:37:10,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:37:10,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:37:10,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:37:10,312 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:37:10,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:37:10,313 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:37:10,313 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:37:10,313 INFO L138 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 [2022-12-13 12:37:10,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:37:10,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:37:10,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:37:10,544 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:37:10,544 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:37:10,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-12-13 12:37:13,174 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:37:13,307 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:37:13,308 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-12-13 12:37:13,313 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data/adaeacf67/4269a938fd384b19913c8968930f9443/FLAGca0cde0b6 [2022-12-13 12:37:13,323 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/data/adaeacf67/4269a938fd384b19913c8968930f9443 [2022-12-13 12:37:13,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:37:13,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:37:13,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:37:13,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:37:13,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:37:13,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74adb505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13, skipping insertion in model container [2022-12-13 12:37:13,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:37:13,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:37:13,439 WARN L237 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-12-13 12:37:13,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:37:13,469 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:37:13,477 WARN L237 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_fe1fedea-3303-44cd-9662-fe2bd08ef969/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-12-13 12:37:13,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:37:13,496 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:37:13,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13 WrapperNode [2022-12-13 12:37:13,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:37:13,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:37:13,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:37:13,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:37:13,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,521 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-12-13 12:37:13,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:37:13,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:37:13,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:37:13,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:37:13,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:37:13,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:37:13,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:37:13,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:37:13,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 12:37:13,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:37:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:37:13,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:37:13,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:37:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:37:13,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:37:13,664 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:37:13,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:37:13,756 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:37:13,761 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:37:13,761 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:37:13,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:13 BoogieIcfgContainer [2022-12-13 12:37:13,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:37:13,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:37:13,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:37:13,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:37:13,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:37:13" (1/3) ... [2022-12-13 12:37:13,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61c46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:13, skipping insertion in model container [2022-12-13 12:37:13,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (2/3) ... [2022-12-13 12:37:13,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61c46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:13, skipping insertion in model container [2022-12-13 12:37:13,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:13" (3/3) ... [2022-12-13 12:37:13,769 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2022-12-13 12:37:13,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:37:13,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:37:13,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:37:13,824 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=LoopsAndPotentialCycles, 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;@4ecc4bc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:37:13,825 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:37:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) [2022-12-13 12:37:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 12:37:13,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:37:13,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:37:13,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:37:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-12-13 12:37:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851383234] [2022-12-13 12:37:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:13,857 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 [2022-12-13 12:37:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:13,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:13,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:13,912 WARN L261 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 12:37:13,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:14,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:37:14,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:14,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851383234] [2022-12-13 12:37:14,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851383234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:14,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:14,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:37:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738383579] [2022-12-13 12:37:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:14,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:37:14,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:37:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:37:14,074 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:37:14,112 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-12-13 12:37:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:37:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 12:37:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:37:14,119 INFO L225 Difference]: With dead ends: 20 [2022-12-13 12:37:14,119 INFO L226 Difference]: Without dead ends: 11 [2022-12-13 12:37:14,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:37:14,124 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:37:14,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:37:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-12-13 12:37:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-12-13 12:37:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-12-13 12:37:14,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-12-13 12:37:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:37:14,144 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-12-13 12:37:14,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-12-13 12:37:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 12:37:14,145 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:37:14,145 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:14,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:14,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:14,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:37:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-12-13 12:37:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880504740] [2022-12-13 12:37:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:14,353 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 [2022-12-13 12:37:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:14,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:14,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:14,497 WARN L261 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 12:37:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:14,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:15,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:37:15,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880504740] [2022-12-13 12:37:15,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880504740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:37:15,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:37:15,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-13 12:37:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201918972] [2022-12-13 12:37:15,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:37:15,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:37:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:37:15,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:37:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:37:15,308 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2022-12-13 12:37:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:37:15,476 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-12-13 12:37:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:37:15,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 12:37:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:37:15,477 INFO L225 Difference]: With dead ends: 19 [2022-12-13 12:37:15,477 INFO L226 Difference]: Without dead ends: 17 [2022-12-13 12:37:15,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:37:15,479 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:37:15,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:37:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-13 12:37:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-12-13 12:37:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-13 12:37:15,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-12-13 12:37:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:37:15,486 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-13 12:37:15,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2022-12-13 12:37:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-13 12:37:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 12:37:15,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:37:15,487 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-12-13 12:37:15,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:15,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:15,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:37:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 2 times [2022-12-13 12:37:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:37:15,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758357130] [2022-12-13 12:37:15,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:37:15,695 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 [2022-12-13 12:37:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:37:15,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:37:15,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:37:15,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:37:15,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:37:15,890 WARN L261 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-13 12:37:15,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:37:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:37:16,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:37:27,951 WARN L233 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 161 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:38:15,349 WARN L233 SmtUtils]: Spent 45.61s on a formula simplification. DAG size of input: 306 DAG size of output: 212 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:38:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:15,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:15,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758357130] [2022-12-13 12:38:15,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758357130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:38:15,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:38:15,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-12-13 12:38:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732145733] [2022-12-13 12:38:15,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:38:15,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 12:38:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 12:38:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-12-13 12:38:15,572 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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) [2022-12-13 12:38:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:38:16,922 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-12-13 12:38:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:38:16,922 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 12:38:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:38:16,923 INFO L225 Difference]: With dead ends: 31 [2022-12-13 12:38:16,923 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 12:38:16,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 58.9s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2022-12-13 12:38:16,925 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:38:16,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:38:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 12:38:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-13 12:38:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-12-13 12:38:16,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-12-13 12:38:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:38:16,931 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-12-13 12:38:16,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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) [2022-12-13 12:38:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-12-13 12:38:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 12:38:16,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:38:16,932 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2022-12-13 12:38:16,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:38:17,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:17,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:38:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 3 times [2022-12-13 12:38:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:17,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875345407] [2022-12-13 12:38:17,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:38:17,139 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 [2022-12-13 12:38:17,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:17,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:38:17,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:38:17,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-12-13 12:38:17,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:38:17,232 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 188 conjunts are in the unsatisfiable core [2022-12-13 12:38:17,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:38:19,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:38:32,221 WARN L233 SmtUtils]: Spent 11.97s on a formula simplification. DAG size of input: 161 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:39:21,936 WARN L233 SmtUtils]: Spent 45.80s on a formula simplification. DAG size of input: 313 DAG size of output: 213 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:39:27,843 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 213 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:40:57,144 WARN L233 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 492 DAG size of output: 292 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:42:00,297 WARN L233 SmtUtils]: Spent 55.77s on a formula simplification. DAG size of input: 728 DAG size of output: 379 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:43:30,596 WARN L233 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 985 DAG size of output: 502 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:43:40,905 WARN L233 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 504 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:46:00,983 WARN L233 SmtUtils]: Spent 2.05m on a formula simplification. DAG size of input: 1359 DAG size of output: 622 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:46:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 76 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:46:01,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:46:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875345407] [2022-12-13 12:46:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875345407] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:46:01,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:46:01,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2022-12-13 12:46:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573493686] [2022-12-13 12:46:01,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:46:01,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 12:46:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:46:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 12:46:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=952, Unknown=1, NotChecked=0, Total=1482 [2022-12-13 12:46:01,529 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 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) [2022-12-13 12:46:06,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:46:07,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:46:09,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:46:11,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:46:14,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:46:15,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:46:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:46:19,316 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-12-13 12:46:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 12:46:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 12:46:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:46:19,317 INFO L225 Difference]: With dead ends: 52 [2022-12-13 12:46:19,317 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 12:46:19,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 460.3s TimeCoverageRelationStatistics Valid=803, Invalid=1548, Unknown=1, NotChecked=0, Total=2352 [2022-12-13 12:46:19,318 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 104 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:46:19,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 29 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2022-12-13 12:46:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 12:46:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-12-13 12:46:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:46:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-12-13 12:46:19,337 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 26 [2022-12-13 12:46:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:46:19,337 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-12-13 12:46:19,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 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) [2022-12-13 12:46:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-12-13 12:46:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 12:46:19,338 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:46:19,338 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2022-12-13 12:46:19,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:46:19,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:46:19,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:46:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:46:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 969805001, now seen corresponding path program 4 times [2022-12-13 12:46:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:46:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970604414] [2022-12-13 12:46:19,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:46:19,539 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 [2022-12-13 12:46:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:46:19,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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) [2022-12-13 12:46:19,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:46:19,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:46:19,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 12:46:19,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:46:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:46:19,812 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 12:46:19,812 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:46:19,813 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:46:19,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 12:46:20,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/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 [2022-12-13 12:46:20,018 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 12:46:20,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,059 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,060 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,060 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,060 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,060 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,060 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,060 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:20 BoogieIcfgContainer [2022-12-13 12:46:20,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:46:20,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:46:20,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:46:20,080 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:46:20,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:13" (3/4) ... [2022-12-13 12:46:20,081 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,098 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,099 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,099 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,099 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,099 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,099 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,099 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 12:46:20,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:46:20,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:46:20,164 INFO L158 Benchmark]: Toolchain (without parser) took 546837.77ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 44.0MB in the beginning and 31.3MB in the end (delta: 12.7MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-12-13 12:46:20,164 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 26.8MB in the beginning and 26.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:46:20,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.41ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 33.0MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 12:46:20,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.11ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 31.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:46:20,165 INFO L158 Benchmark]: Boogie Preprocessor took 21.31ms. Allocated memory is still 65.0MB. Free memory was 31.4MB in the beginning and 46.2MB in the end (delta: -14.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-12-13 12:46:20,165 INFO L158 Benchmark]: RCFGBuilder took 219.56ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 35.9MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:46:20,165 INFO L158 Benchmark]: TraceAbstraction took 546315.14ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 35.3MB in the beginning and 42.9MB in the end (delta: -7.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2022-12-13 12:46:20,166 INFO L158 Benchmark]: Witness Printer took 83.73ms. Allocated memory is still 117.4MB. Free memory was 42.9MB in the beginning and 31.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 12:46:20,167 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 26.8MB in the beginning and 26.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.41ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 33.0MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.11ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 31.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.31ms. Allocated memory is still 65.0MB. Free memory was 31.4MB in the beginning and 46.2MB in the end (delta: -14.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * RCFGBuilder took 219.56ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 35.9MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 546315.14ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 35.3MB in the beginning and 42.9MB in the end (delta: -7.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 83.73ms. Allocated memory is still 117.4MB. Free memory was 42.9MB in the beginning and 31.3MB in the end (delta: 11.5MB). 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L31] const SORT_4 var_5 = 1; [L32] const SORT_4 var_8 = 15; [L33] const SORT_1 var_12 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L38] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L40] SORT_4 init_7_arg_1 = var_5; [L41] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_5=1, var_8=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=16, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=2, state_6=2, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=2, var_17_arg_0=1, var_17_arg_1=1, var_18=0, var_18_arg_0=1, var_18_arg_1=15, var_19=2, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=2, var_20=2, var_20_arg_0=1, var_20_arg_1=2, var_20_arg_2=1, var_5=1, var_8=15, var_9=1, var_9_arg_0=1, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=17, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=3, state_6=3, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=3, var_17_arg_0=2, var_17_arg_1=1, var_18=0, var_18_arg_0=2, var_18_arg_1=15, var_19=3, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=3, var_20=3, var_20_arg_0=1, var_20_arg_1=3, var_20_arg_2=2, var_5=1, var_8=15, var_9=1, var_9_arg_0=2, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=18, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=4, state_6=4, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=4, var_17_arg_0=3, var_17_arg_1=1, var_18=0, var_18_arg_0=3, var_18_arg_1=15, var_19=4, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=4, var_20=4, var_20_arg_0=1, var_20_arg_1=4, var_20_arg_2=3, var_5=1, var_8=15, var_9=1, var_9_arg_0=3, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=19, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=5, state_6=5, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=5, var_17_arg_0=4, var_17_arg_1=1, var_18=0, var_18_arg_0=4, var_18_arg_1=15, var_19=5, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=5, var_20=5, var_20_arg_0=1, var_20_arg_1=5, var_20_arg_2=4, var_5=1, var_8=15, var_9=1, var_9_arg_0=4, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=20, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=6, state_6=6, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=6, var_17_arg_0=5, var_17_arg_1=1, var_18=0, var_18_arg_0=5, var_18_arg_1=15, var_19=6, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=6, var_20=6, var_20_arg_0=1, var_20_arg_1=6, var_20_arg_2=5, var_5=1, var_8=15, var_9=1, var_9_arg_0=5, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=21, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=7, state_6=7, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=7, var_17_arg_0=6, var_17_arg_1=1, var_18=0, var_18_arg_0=6, var_18_arg_1=15, var_19=7, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=7, var_20=7, var_20_arg_0=1, var_20_arg_1=7, var_20_arg_2=6, var_5=1, var_8=15, var_9=1, var_9_arg_0=6, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=22, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=8, state_6=8, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=8, var_17_arg_0=7, var_17_arg_1=1, var_18=0, var_18_arg_0=7, var_18_arg_1=15, var_19=8, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=8, var_20=8, var_20_arg_0=1, var_20_arg_1=8, var_20_arg_2=7, var_5=1, var_8=15, var_9=1, var_9_arg_0=7, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=23, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=9, state_6=9, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=9, var_17_arg_0=8, var_17_arg_1=1, var_18=0, var_18_arg_0=8, var_18_arg_1=15, var_19=9, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=9, var_20=9, var_20_arg_0=1, var_20_arg_1=9, var_20_arg_2=8, var_5=1, var_8=15, var_9=1, var_9_arg_0=8, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=24, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=10, state_6=10, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=10, var_17_arg_0=9, var_17_arg_1=1, var_18=0, var_18_arg_0=9, var_18_arg_1=15, var_19=10, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=10, var_20=10, var_20_arg_0=1, var_20_arg_1=10, var_20_arg_2=9, var_5=1, var_8=15, var_9=1, var_9_arg_0=9, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=25, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=11, state_6=11, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=11, var_17_arg_0=10, var_17_arg_1=1, var_18=0, var_18_arg_0=10, var_18_arg_1=15, var_19=11, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=11, var_20=11, var_20_arg_0=1, var_20_arg_1=11, var_20_arg_2=10, var_5=1, var_8=15, var_9=1, var_9_arg_0=10, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=26, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=12, state_6=12, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=12, var_17_arg_0=11, var_17_arg_1=1, var_18=0, var_18_arg_0=11, var_18_arg_1=15, var_19=12, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=12, var_20=12, var_20_arg_0=1, var_20_arg_1=12, var_20_arg_2=11, var_5=1, var_8=15, var_9=1, var_9_arg_0=11, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=27, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=13, state_6=13, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=13, var_17_arg_0=12, var_17_arg_1=1, var_18=0, var_18_arg_0=12, var_18_arg_1=15, var_19=13, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=13, var_20=13, var_20_arg_0=1, var_20_arg_1=13, var_20_arg_2=12, var_5=1, var_8=15, var_9=1, var_9_arg_0=12, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=28, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=14, state_6=14, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=14, var_17_arg_0=13, var_17_arg_1=1, var_18=0, var_18_arg_0=13, var_18_arg_1=15, var_19=14, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=14, var_20=14, var_20_arg_0=1, var_20_arg_1=14, var_20_arg_2=13, var_5=1, var_8=15, var_9=1, var_9_arg_0=13, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=29, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=15, state_6=15, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=15, var_17_arg_0=14, var_17_arg_1=1, var_18=0, var_18_arg_0=14, var_18_arg_1=15, var_19=15, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=15, var_20=15, var_20_arg_0=1, var_20_arg_1=15, var_20_arg_2=14, var_5=1, var_8=15, var_9=1, var_9_arg_0=14, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 546.2s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 17 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 519.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 524.9s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 37 QuantifiedInterpolants, 25550 SizeOfPredicates, 319 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 318 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! [2022-12-13 12:46:20,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe1fedea-3303-44cd-9662-fe2bd08ef969/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE