./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 --- 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 18:40:57,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:40:57,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:40:57,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:40:57,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:40:57,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:40:57,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:40:57,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:40:57,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:40:57,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:40:57,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:40:57,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:40:57,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:40:57,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:40:57,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:40:57,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:40:57,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:40:57,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:40:57,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:40:57,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:40:57,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:40:57,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:40:57,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:40:57,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:40:57,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:40:57,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:40:57,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:40:57,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:40:57,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:40:57,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:40:57,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:40:57,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:40:57,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:40:57,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:40:57,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:40:57,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:40:57,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:40:57,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:40:57,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:40:57,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:40:57,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:40:57,772 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 18:40:57,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:40:57,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:40:57,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:40:57,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:40:57,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:40:57,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:40:57,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:40:57,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:40:57,800 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:40:57,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:40:57,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:40:57,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:40:57,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:40:57,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:40:57,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:40:57,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:40:57,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:40:57,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:40:57,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:40:57,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:40:57,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:40:57,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:40:57,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:40:57,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:40:57,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:40:57,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:40:57,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:40:57,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:40:57,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:40:57,804 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:40:57,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:40:57,804 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:40:57,804 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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 -> 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 [2022-12-13 18:40:57,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:40:58,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:40:58,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:40:58,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:40:58,008 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:40:58,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-12-13 18:41:00,538 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:41:00,716 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:41:00,717 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-12-13 18:41:00,722 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data/a33f28d4c/1fb092da88df44918d6ba504d4d860f6/FLAG30486e2a1 [2022-12-13 18:41:01,112 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data/a33f28d4c/1fb092da88df44918d6ba504d4d860f6 [2022-12-13 18:41:01,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:41:01,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:41:01,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:41:01,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:41:01,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:41:01,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6a8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01, skipping insertion in model container [2022-12-13 18:41:01,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:41:01,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:41:01,239 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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-12-13 18:41:01,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:41:01,272 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:41:01,281 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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-12-13 18:41:01,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:41:01,304 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:41:01,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01 WrapperNode [2022-12-13 18:41:01,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:41:01,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:41:01,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:41:01,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:41:01,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,331 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-12-13 18:41:01,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:41:01,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:41:01,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:41:01,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:41:01,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,346 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:41:01,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:41:01,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:41:01,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:41:01,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (1/1) ... [2022-12-13 18:41:01,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:41:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:41:01,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:41:01,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:41:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:41:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:41:01,475 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:41:01,477 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:41:01,599 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:41:01,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:41:01,606 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 18:41:01,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:41:01 BoogieIcfgContainer [2022-12-13 18:41:01,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:41:01,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:41:01,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:41:01,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:41:01,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:41:01" (1/3) ... [2022-12-13 18:41:01,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0d4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:41:01, skipping insertion in model container [2022-12-13 18:41:01,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:01" (2/3) ... [2022-12-13 18:41:01,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0d4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:41:01, skipping insertion in model container [2022-12-13 18:41:01,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:41:01" (3/3) ... [2022-12-13 18:41:01,617 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2022-12-13 18:41:01,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:41:01,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:41:01,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:41:01,690 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;@72cd1f8a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:41:01,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:41:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:41:01,699 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:01,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:01,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1809708109, now seen corresponding path program 1 times [2022-12-13 18:41:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:01,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792779853] [2022-12-13 18:41:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:01,844 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 18:41:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:01,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792779853] [2022-12-13 18:41:01,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792779853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:01,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:01,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:41:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181402440] [2022-12-13 18:41:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:01,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:41:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:41:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:41:01,884 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 18:41:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:01,894 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-12-13 18:41:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:41:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 18:41:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:01,902 INFO L225 Difference]: With dead ends: 20 [2022-12-13 18:41:01,902 INFO L226 Difference]: Without dead ends: 9 [2022-12-13 18:41:01,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:41:01,910 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:01,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:41:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-12-13 18:41:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-12-13 18:41:01,938 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 18:41:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-12-13 18:41:01,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-12-13 18:41:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:01,940 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-12-13 18:41:01,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 18:41:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-12-13 18:41:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:41:01,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:01,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:01,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:41:01,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767691, now seen corresponding path program 1 times [2022-12-13 18:41:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:01,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395704327] [2022-12-13 18:41:01,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:01,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:02,310 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 18:41:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395704327] [2022-12-13 18:41:02,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395704327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:02,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:02,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:41:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863064518] [2022-12-13 18:41:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:02,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:41:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:41:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:41:02,314 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 18:41:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:02,347 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-12-13 18:41:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:41:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 18:41:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:02,348 INFO L225 Difference]: With dead ends: 16 [2022-12-13 18:41:02,348 INFO L226 Difference]: Without dead ends: 14 [2022-12-13 18:41:02,348 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 18:41:02,350 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:02,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:41:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-13 18:41:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-12-13 18:41:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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 18:41:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-13 18:41:02,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-12-13 18:41:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:02,353 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-13 18:41:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 18:41:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-13 18:41:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 18:41:02,353 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:02,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:41:02,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1841040349, now seen corresponding path program 1 times [2022-12-13 18:41:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:02,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655420665] [2022-12-13 18:41:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:41:02,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:41:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:41:02,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:41:02,555 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:41:02,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 18:41:02,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:41:02,560 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 18:41:02,562 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:41:02,575 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:41:02,575 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:41:02,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:41:02 BoogieIcfgContainer [2022-12-13 18:41:02,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:41:02,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:41:02,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:41:02,581 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:41:02,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:41:01" (3/4) ... [2022-12-13 18:41:02,584 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 18:41:02,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:41:02,584 INFO L158 Benchmark]: Toolchain (without parser) took 1468.91ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 91.4MB in the beginning and 86.2MB in the end (delta: 5.3MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-12-13 18:41:02,585 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 100.1MB in the beginning and 99.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:41:02,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.37ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 80.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:41:02,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.26ms. Allocated memory is still 125.8MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:41:02,586 INFO L158 Benchmark]: Boogie Preprocessor took 17.42ms. Allocated memory is still 125.8MB. Free memory was 78.7MB in the beginning and 77.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:41:02,586 INFO L158 Benchmark]: RCFGBuilder took 258.66ms. Allocated memory is still 125.8MB. Free memory was 77.4MB in the beginning and 64.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 18:41:02,587 INFO L158 Benchmark]: TraceAbstraction took 969.97ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 64.0MB in the beginning and 86.2MB in the end (delta: -22.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-12-13 18:41:02,587 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 151.0MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:41:02,589 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.13ms. Allocated memory is still 125.8MB. Free memory was 100.1MB in the beginning and 99.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.37ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 80.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.26ms. Allocated memory is still 125.8MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.42ms. Allocated memory is still 125.8MB. Free memory was 78.7MB in the beginning and 77.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 258.66ms. Allocated memory is still 125.8MB. Free memory was 77.4MB in the beginning and 64.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 969.97ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 64.0MB in the beginning and 86.2MB in the end (delta: -22.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 151.0MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 55, overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L32] const SORT_2 var_5 = 0; [L33] const SORT_2 var_10 = 1; [L34] const SORT_2 var_17 = mask_SORT_2; [L36] SORT_1 input_3; [L37] SORT_1 input_4; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_8_arg_1 = var_5; [L43] state_6 = init_8_arg_1 [L44] SORT_2 init_9_arg_1 = var_5; [L45] state_7 = init_9_arg_1 VAL [init_8_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=8, cond=8] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=8, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=7, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=7, var_14_arg_1=1, var_14_arg_2=0, var_17=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=8, var_22_arg_0=1, var_22_arg_1=7, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=9, cond=9] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 18 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 18:41:02,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 --- 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 18:41:04,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:41:04,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:41:04,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:41:04,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:41:04,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:41:04,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:41:04,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:41:04,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:41:04,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:41:04,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:41:04,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:41:04,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:41:04,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:41:04,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:41:04,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:41:04,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:41:04,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:41:04,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:41:04,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:41:04,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:41:04,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:41:04,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:41:04,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:41:04,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:41:04,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:41:04,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:41:04,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:41:04,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:41:04,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:41:04,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:41:04,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:41:04,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:41:04,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:41:04,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:41:04,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:41:04,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:41:04,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:41:04,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:41:04,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:41:04,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:41:04,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-12-13 18:41:04,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:41:04,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:41:04,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:41:04,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:41:04,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:41:04,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:41:04,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:41:04,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:41:04,266 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:41:04,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:41:04,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:41:04,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:41:04,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:41:04,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:41:04,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 18:41:04,268 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 18:41:04,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:41:04,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:41:04,279 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:41:04,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:41:04,280 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 18:41:04,280 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:41:04,280 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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 -> 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 [2022-12-13 18:41:04,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:41:04,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:41:04,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:41:04,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:41:04,505 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:41:04,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-12-13 18:41:06,981 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:41:07,143 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:41:07,143 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-12-13 18:41:07,149 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data/3688223a4/6bc129c03e99451da56749a615d0124b/FLAG40c4ce10b [2022-12-13 18:41:07,542 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/data/3688223a4/6bc129c03e99451da56749a615d0124b [2022-12-13 18:41:07,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:41:07,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:41:07,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:41:07,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:41:07,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:41:07,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e10dcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07, skipping insertion in model container [2022-12-13 18:41:07,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:41:07,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:41:07,669 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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-12-13 18:41:07,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:41:07,706 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:41:07,714 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_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-12-13 18:41:07,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:41:07,742 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:41:07,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07 WrapperNode [2022-12-13 18:41:07,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:41:07,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:41:07,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:41:07,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:41:07,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,770 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-12-13 18:41:07,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:41:07,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:41:07,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:41:07,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:41:07,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,786 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:41:07,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:41:07,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:41:07,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:41:07,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (1/1) ... [2022-12-13 18:41:07,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:41:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:41:07,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:41:07,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:41:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:41:07,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:41:07,918 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:41:07,920 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:41:08,041 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:41:08,047 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:41:08,048 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 18:41:08,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:41:08 BoogieIcfgContainer [2022-12-13 18:41:08,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:41:08,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:41:08,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:41:08,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:41:08,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:41:07" (1/3) ... [2022-12-13 18:41:08,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742560f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:41:08, skipping insertion in model container [2022-12-13 18:41:08,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:41:07" (2/3) ... [2022-12-13 18:41:08,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742560f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:41:08, skipping insertion in model container [2022-12-13 18:41:08,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:41:08" (3/3) ... [2022-12-13 18:41:08,058 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2022-12-13 18:41:08,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:41:08,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:41:08,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:41:08,129 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;@22c4d75c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:41:08,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:41:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:41:08,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:08,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:08,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1809708109, now seen corresponding path program 1 times [2022-12-13 18:41:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:41:08,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898227941] [2022-12-13 18:41:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:08,160 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 18:41:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:41:08,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:08,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 18:41:08,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:08,244 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 18:41:08,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:41:08,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:41:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898227941] [2022-12-13 18:41:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898227941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:08,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:08,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:41:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148993482] [2022-12-13 18:41:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:08,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:41:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:41:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:41:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:41:08,281 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 18:41:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:08,292 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-12-13 18:41:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:41:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 18:41:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:08,302 INFO L225 Difference]: With dead ends: 20 [2022-12-13 18:41:08,303 INFO L226 Difference]: Without dead ends: 9 [2022-12-13 18:41:08,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:41:08,309 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:08,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:41:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-12-13 18:41:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-12-13 18:41:08,336 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 18:41:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-12-13 18:41:08,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-12-13 18:41:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:08,338 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-12-13 18:41:08,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 18:41:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-12-13 18:41:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 18:41:08,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:08,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:08,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:08,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767691, now seen corresponding path program 1 times [2022-12-13 18:41:08,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:41:08,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301019213] [2022-12-13 18:41:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:08,542 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 18:41:08,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:41:08,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:08,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 18:41:08,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:08,702 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 18:41:08,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:41:08,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:41:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301019213] [2022-12-13 18:41:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301019213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:08,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:08,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:41:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415787542] [2022-12-13 18:41:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:08,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:41:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:41:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:41:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:41:08,706 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 18:41:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:08,737 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-12-13 18:41:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:41:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 18:41:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:08,738 INFO L225 Difference]: With dead ends: 19 [2022-12-13 18:41:08,738 INFO L226 Difference]: Without dead ends: 17 [2022-12-13 18:41:08,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:41:08,739 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:08,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:41:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-13 18:41:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2022-12-13 18:41:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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 18:41:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-13 18:41:08,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-12-13 18:41:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:08,743 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-13 18:41:08,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 18:41:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-13 18:41:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 18:41:08,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:08,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:08,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:08,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1841040349, now seen corresponding path program 1 times [2022-12-13 18:41:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:41:08,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94137401] [2022-12-13 18:41:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:08,949 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 18:41:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:41:08,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:08,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:09,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 18:41:09,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:09,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:41:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:09,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:41:09,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94137401] [2022-12-13 18:41:09,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94137401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:41:09,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:41:09,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-13 18:41:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024970805] [2022-12-13 18:41:09,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:41:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:41:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:41:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:41:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:41:09,576 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 18:41:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:09,725 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-12-13 18:41:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:41:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 18:41:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:09,726 INFO L225 Difference]: With dead ends: 29 [2022-12-13 18:41:09,726 INFO L226 Difference]: Without dead ends: 27 [2022-12-13 18:41:09,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:41:09,727 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:09,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:41:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-13 18:41:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-12-13 18:41:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 18:41:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-12-13 18:41:09,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2022-12-13 18:41:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:09,732 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-12-13 18:41:09,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 18:41:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-12-13 18:41:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 18:41:09,732 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:09,732 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-12-13 18:41:09,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:09,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:09,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1190222557, now seen corresponding path program 2 times [2022-12-13 18:41:09,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:41:09,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699038970] [2022-12-13 18:41:09,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:41:09,936 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 18:41:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:41:09,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:09,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:10,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:41:10,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:41:10,130 WARN L261 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-13 18:41:10,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:11,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:41:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:16,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:41:16,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699038970] [2022-12-13 18:41:16,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699038970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:41:16,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:41:16,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-12-13 18:41:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121709388] [2022-12-13 18:41:16,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:41:16,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 18:41:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:41:16,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 18:41:16,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2022-12-13 18:41:16,210 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:16,733 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-12-13 18:41:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 18:41:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 18:41:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:16,734 INFO L225 Difference]: With dead ends: 34 [2022-12-13 18:41:16,734 INFO L226 Difference]: Without dead ends: 32 [2022-12-13 18:41:16,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2022-12-13 18:41:16,735 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:16,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:41:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-13 18:41:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-12-13 18:41:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 18:41:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-12-13 18:41:16,739 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2022-12-13 18:41:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:16,739 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-12-13 18:41:16,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-12-13 18:41:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 18:41:16,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:16,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-12-13 18:41:16,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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)] Forceful destruction successful, exit code 0 [2022-12-13 18:41:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:16,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1666876661, now seen corresponding path program 3 times [2022-12-13 18:41:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:41:16,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840541770] [2022-12-13 18:41:16,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:41:16,946 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 18:41:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:41:16,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:16,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:41:17,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 18:41:17,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:41:17,040 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 143 conjunts are in the unsatisfiable core [2022-12-13 18:41:17,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:21,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:42:15,202 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 647 DAG size of output: 636 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:42:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:15,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:42:15,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840541770] [2022-12-13 18:42:15,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840541770] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:42:15,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:42:15,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2022-12-13 18:42:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875416198] [2022-12-13 18:42:15,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:42:15,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 18:42:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:42:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 18:42:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 18:42:15,237 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 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 18:42:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:42:17,605 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-12-13 18:42:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 18:42:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 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 27 [2022-12-13 18:42:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:42:17,606 INFO L225 Difference]: With dead ends: 44 [2022-12-13 18:42:17,606 INFO L226 Difference]: Without dead ends: 42 [2022-12-13 18:42:17,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=557, Invalid=1335, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 18:42:17,608 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:17,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 55 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:42:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-13 18:42:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-12-13 18:42:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 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 18:42:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-12-13 18:42:17,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 27 [2022-12-13 18:42:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:17,615 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-12-13 18:42:17,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 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 18:42:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-12-13 18:42:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 18:42:17,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:17,616 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2022-12-13 18:42:17,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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)] Forceful destruction successful, exit code 0 [2022-12-13 18:42:17,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:42:17,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:17,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1560106485, now seen corresponding path program 4 times [2022-12-13 18:42:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:42:17,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300588397] [2022-12-13 18:42:17,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:42:17,821 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 18:42:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:42:17,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:42:17,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 (7)] Waiting until timeout for monitored process [2022-12-13 18:42:17,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:42:17,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 18:42:17,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:42:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:42:18,074 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 18:42:18,074 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:42:18,075 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 18:42:18,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 (7)] Ended with exit code 0 [2022-12-13 18:42:18,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 18:42:18,280 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-12-13 18:42:18,282 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,313 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:42:18 BoogieIcfgContainer [2022-12-13 18:42:18,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:42:18,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:42:18,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:42:18,330 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:42:18,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:41:08" (3/4) ... [2022-12-13 18:42:18,331 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 18:42:18,340 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,340 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,340 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,340 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,340 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,340 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,341 WARN L321 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-12-13 18:42:18,381 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:42:18,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:42:18,381 INFO L158 Benchmark]: Toolchain (without parser) took 70836.22ms. Allocated memory was 77.6MB in the beginning and 285.2MB in the end (delta: 207.6MB). Free memory was 55.3MB in the beginning and 106.4MB in the end (delta: -51.1MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,381 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:42:18,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.34ms. Allocated memory is still 77.6MB. Free memory was 55.1MB in the beginning and 44.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 77.6MB. Free memory was 43.8MB in the beginning and 42.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,382 INFO L158 Benchmark]: Boogie Preprocessor took 17.25ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 41.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:42:18,382 INFO L158 Benchmark]: RCFGBuilder took 261.21ms. Allocated memory is still 77.6MB. Free memory was 41.0MB in the beginning and 49.0MB in the end (delta: -8.0MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,383 INFO L158 Benchmark]: TraceAbstraction took 70277.40ms. Allocated memory was 77.6MB in the beginning and 285.2MB in the end (delta: 207.6MB). Free memory was 48.3MB in the beginning and 114.8MB in the end (delta: -66.5MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,383 INFO L158 Benchmark]: Witness Printer took 51.63ms. Allocated memory is still 285.2MB. Free memory was 114.8MB in the beginning and 106.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,385 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 54.5MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.34ms. Allocated memory is still 77.6MB. Free memory was 55.1MB in the beginning and 44.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 77.6MB. Free memory was 43.8MB in the beginning and 42.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.25ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 41.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 261.21ms. Allocated memory is still 77.6MB. Free memory was 41.0MB in the beginning and 49.0MB in the end (delta: -8.0MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * TraceAbstraction took 70277.40ms. Allocated memory was 77.6MB in the beginning and 285.2MB in the end (delta: 207.6MB). Free memory was 48.3MB in the beginning and 114.8MB in the end (delta: -66.5MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. * Witness Printer took 51.63ms. Allocated memory is still 285.2MB. Free memory was 114.8MB in the beginning and 106.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L32] const SORT_2 var_5 = 0; [L33] const SORT_2 var_10 = 1; [L34] const SORT_2 var_17 = mask_SORT_2; [L36] SORT_1 input_3; [L37] SORT_1 input_4; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_8_arg_1 = var_5; [L43] state_6 = init_8_arg_1 [L44] SORT_2 init_9_arg_1 = var_5; [L45] state_7 = init_9_arg_1 VAL [init_8_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=0, next_16_arg_1=1, state_6=0, state_7=1, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=1, var_13=0, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=1, next_16_arg_1=1, state_6=1, state_7=1, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=1, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=0, var_14_arg_1=2, var_14_arg_2=1, var_17=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=2, next_16_arg_1=1, state_6=2, state_7=1, var_10=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=2, var_13_arg_0=1, var_13_arg_1=2, var_13_arg_2=1, var_14=1, var_14_arg_0=0, var_14_arg_1=2, var_14_arg_2=1, var_17=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=2, next_16_arg_1=2, state_6=2, state_7=2, var_10=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=2, var_13_arg_0=0, var_13_arg_1=3, var_13_arg_2=2, var_14=2, var_14_arg_0=1, var_14_arg_1=2, var_14_arg_2=1, var_17=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=2, state_6=3, state_7=2, var_10=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=2, var_12_arg_1=1, var_13=3, var_13_arg_0=1, var_13_arg_1=3, var_13_arg_2=2, var_14=2, var_14_arg_0=0, var_14_arg_1=3, var_14_arg_2=2, var_17=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=2, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=1, var_11=4, var_11_arg_0=3, var_11_arg_1=1, var_12=3, var_12_arg_0=2, var_12_arg_1=1, var_13=3, var_13_arg_0=0, var_13_arg_1=4, var_13_arg_2=3, var_14=3, var_14_arg_0=1, var_14_arg_1=3, var_14_arg_2=2, var_17=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=2, var_19_arg_1=3, var_20=0, var_20_arg_0=1, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.2s, OverallIterations: 6, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 31 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, 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, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 64.9s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 71 QuantifiedInterpolants, 69526 SizeOfPredicates, 262 NumberOfNonLiveVariables, 505 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/154 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 18:42:18,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dd0c35a-f6a6-42ad-ba2a-d95e1e03fe27/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE