./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-010.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-010.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN --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 32bit --witnessprinter.graph.data.programhash bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2 --- 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-6b4ec56 [2022-11-20 12:09:27,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:09:27,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:09:27,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:09:27,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:09:27,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:09:27,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:09:27,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:09:27,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:09:27,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:09:27,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:09:27,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:09:27,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:09:27,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:09:27,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:09:27,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:09:27,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:09:27,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:09:27,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:09:27,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:09:27,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:09:27,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:09:27,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:09:27,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:09:27,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:09:27,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:09:27,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:09:27,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:09:27,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:09:27,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:09:27,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:09:27,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:09:27,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:09:27,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:09:27,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:09:27,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:09:27,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:09:27,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:09:27,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:09:27,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:09:27,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:09:27,915 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:09:27,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:09:27,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:09:27,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:09:27,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:09:27,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:09:27,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:09:27,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:09:27,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:09:27,937 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:09:27,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:09:27,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:09:27,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:09:27,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:09:27,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:09:27,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:09:27,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:09:27,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:09:27,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:09:27,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:09:27,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:09:27,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:09:27,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:09:27,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:09:27,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:09:27,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:09:27,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:09:27,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:09:27,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:09:27,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:09:27,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:09:27,941 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:09:27,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:09:27,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:09:27,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/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_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2 [2022-11-20 12:09:28,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:09:28,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:09:28,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:09:28,245 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:09:28,246 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:09:28,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/xcsp/AllInterval-010.c [2022-11-20 12:09:31,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:09:31,610 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:09:31,611 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/sv-benchmarks/c/xcsp/AllInterval-010.c [2022-11-20 12:09:31,622 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/data/ad902867b/e28cb633e3d042c091ffa93e95fcc507/FLAG1816c5fed [2022-11-20 12:09:31,640 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/data/ad902867b/e28cb633e3d042c091ffa93e95fcc507 [2022-11-20 12:09:31,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:09:31,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:09:31,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:09:31,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:09:31,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:09:31,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:31" (1/1) ... [2022-11-20 12:09:31,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad1e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:31, skipping insertion in model container [2022-11-20 12:09:31,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:31" (1/1) ... [2022-11-20 12:09:31,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:09:31,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:09:31,955 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_852d5ee5-d1a9-494a-95a1-ead867ef9134/sv-benchmarks/c/xcsp/AllInterval-010.c[5778,5791] [2022-11-20 12:09:31,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:09:31,974 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:09:32,014 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_852d5ee5-d1a9-494a-95a1-ead867ef9134/sv-benchmarks/c/xcsp/AllInterval-010.c[5778,5791] [2022-11-20 12:09:32,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:09:32,029 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:09:32,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32 WrapperNode [2022-11-20 12:09:32,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:09:32,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:09:32,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:09:32,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:09:32,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,097 INFO L138 Inliner]: procedures = 13, calls = 135, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 240 [2022-11-20 12:09:32,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:09:32,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:09:32,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:09:32,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:09:32,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:09:32,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:09:32,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:09:32,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:09:32,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (1/1) ... [2022-11-20 12:09:32,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:09:32,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:09:32,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:09:32,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:09:32,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:09:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:09:32,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:09:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:09:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-11-20 12:09:32,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-11-20 12:09:32,316 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:09:32,319 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:09:32,777 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:09:32,801 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:09:32,801 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:09:32,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:32 BoogieIcfgContainer [2022-11-20 12:09:32,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:09:32,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:09:32,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:09:32,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:09:32,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:09:31" (1/3) ... [2022-11-20 12:09:32,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389ba98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:32, skipping insertion in model container [2022-11-20 12:09:32,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:32" (2/3) ... [2022-11-20 12:09:32,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389ba98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:32, skipping insertion in model container [2022-11-20 12:09:32,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:32" (3/3) ... [2022-11-20 12:09:32,817 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-010.c [2022-11-20 12:09:32,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:09:32,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:09:32,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:09:32,949 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;@314982d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:09:32,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:09:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2022-11-20 12:09:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2022-11-20 12:09:33,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:33,028 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:33,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash 588204487, now seen corresponding path program 1 times [2022-11-20 12:09:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:33,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868821276] [2022-11-20 12:09:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:09:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 12:09:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 12:09:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 12:09:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:09:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 12:09:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 12:09:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:09:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:09:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:09:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 12:09:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:09:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:09:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:09:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 12:09:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:09:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:09:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 12:09:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 12:09:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 12:09:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 12:09:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 12:09:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 12:09:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 12:09:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-20 12:09:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 12:09:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 12:09:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 12:09:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:09:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 12:09:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-20 12:09:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-20 12:09:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 12:09:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-20 12:09:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-20 12:09:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-20 12:09:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-20 12:09:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 12:09:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 12:09:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-20 12:09:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-20 12:09:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-20 12:09:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-20 12:09:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-20 12:09:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-20 12:09:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-20 12:09:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-20 12:09:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-11-20 12:09:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-20 12:09:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-20 12:09:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-20 12:09:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-20 12:09:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-20 12:09:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-20 12:09:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-20 12:09:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-20 12:09:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-20 12:09:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-11-20 12:09:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-20 12:09:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-11-20 12:09:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-20 12:09:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-20 12:09:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-20 12:09:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-11-20 12:09:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-20 12:09:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2022-11-20 12:09:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-11-20 12:09:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-11-20 12:09:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2022-11-20 12:09:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-11-20 12:09:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2022-11-20 12:09:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2022-11-20 12:09:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-11-20 12:09:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-11-20 12:09:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-11-20 12:09:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2022-11-20 12:09:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2022-11-20 12:09:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2022-11-20 12:09:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-11-20 12:09:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-20 12:09:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2022-11-20 12:09:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2022-11-20 12:09:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-11-20 12:09:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-11-20 12:09:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2022-11-20 12:09:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2022-11-20 12:09:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 451 [2022-11-20 12:09:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2022-11-20 12:09:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2022-11-20 12:09:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-11-20 12:09:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-11-20 12:09:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2022-11-20 12:09:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2022-11-20 12:09:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-11-20 12:09:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-11-20 12:09:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2022-11-20 12:09:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501 [2022-11-20 12:09:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2022-11-20 12:09:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2022-11-20 12:09:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 516 [2022-11-20 12:09:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 521 [2022-11-20 12:09:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-11-20 12:09:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 531 [2022-11-20 12:09:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2022-11-20 12:09:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2022-11-20 12:09:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2022-11-20 12:09:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2022-11-20 12:09:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 556 [2022-11-20 12:09:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 561 [2022-11-20 12:09:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2022-11-20 12:09:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2022-11-20 12:09:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2022-11-20 12:09:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2022-11-20 12:09:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2022-11-20 12:09:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 591 [2022-11-20 12:09:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 596 [2022-11-20 12:09:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 601 [2022-11-20 12:09:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 606 [2022-11-20 12:09:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 611 [2022-11-20 12:09:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2022-11-20 12:09:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2022-11-20 12:09:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 629 [2022-11-20 12:09:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 635 [2022-11-20 12:09:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 641 [2022-11-20 12:09:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2022-11-20 12:09:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2022-11-20 12:09:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 659 [2022-11-20 12:09:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2022-11-20 12:09:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:09:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2022-11-20 12:09:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:09:34,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868821276] [2022-11-20 12:09:34,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868821276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:09:34,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:09:34,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:09:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086493224] [2022-11-20 12:09:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:09:34,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:09:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:09:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:09:34,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:09:34,407 INFO L87 Difference]: Start difference. First operand has 167 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2022-11-20 12:09:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:09:34,465 INFO L93 Difference]: Finished difference Result 328 states and 710 transitions. [2022-11-20 12:09:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:09:34,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) Word has length 671 [2022-11-20 12:09:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:09:34,477 INFO L225 Difference]: With dead ends: 328 [2022-11-20 12:09:34,477 INFO L226 Difference]: Without dead ends: 164 [2022-11-20 12:09:34,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 386 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-11-20 12:09:34,488 INFO L413 NwaCegarLoop]: 290 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, 290 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-11-20 12:09:34,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:09:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-20 12:09:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-20 12:09:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 34 states have (on average 1.0) internal successors, (34), 34 states have internal predecessors, (34), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2022-11-20 12:09:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 290 transitions. [2022-11-20 12:09:34,599 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 290 transitions. Word has length 671 [2022-11-20 12:09:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:09:34,602 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 290 transitions. [2022-11-20 12:09:34,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2022-11-20 12:09:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 290 transitions. [2022-11-20 12:09:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2022-11-20 12:09:34,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:09:34,643 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:09:34,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:09:34,644 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:09:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:09:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 354405747, now seen corresponding path program 1 times [2022-11-20 12:09:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:09:34,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130830084] [2022-11-20 12:09:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:09:34,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:09:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:09:58,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:10:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:10:04,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:10:04,660 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:10:04,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:10:04,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:10:04,668 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 12:10:04,675 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:10:04,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:10:04 BoogieIcfgContainer [2022-11-20 12:10:04,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:10:04,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:10:04,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:10:04,910 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:10:04,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:32" (3/4) ... [2022-11-20 12:10:04,913 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 12:10:05,106 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:10:05,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:10:05,107 INFO L158 Benchmark]: Toolchain (without parser) took 33463.31ms. Allocated memory was 163.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 134.6MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-20 12:10:05,108 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:10:05,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.07ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 127.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 12:10:05,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.42ms. Allocated memory is still 163.6MB. Free memory was 127.3MB in the beginning and 125.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:10:05,109 INFO L158 Benchmark]: Boogie Preprocessor took 29.61ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:10:05,109 INFO L158 Benchmark]: RCFGBuilder took 675.65ms. Allocated memory is still 163.6MB. Free memory was 123.2MB in the beginning and 101.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:10:05,109 INFO L158 Benchmark]: TraceAbstraction took 32102.78ms. Allocated memory was 163.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 101.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-20 12:10:05,110 INFO L158 Benchmark]: Witness Printer took 196.58ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:10:05,112 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.26ms. Allocated memory is still 130.0MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.07ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 127.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.42ms. Allocated memory is still 163.6MB. Free memory was 127.3MB in the beginning and 125.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.61ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 675.65ms. Allocated memory is still 163.6MB. Free memory was 123.2MB in the beginning and 101.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32102.78ms. Allocated memory was 163.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 101.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 196.58ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. 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: 213]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=2] [L30] CALL assume(var0 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 9) VAL [dummy=0, var0=2] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=2, var1=9] [L34] CALL assume(var1 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 9) VAL [dummy=0, var0=2, var1=9] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0] [L38] CALL assume(var2 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8] [L42] CALL assume(var3 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4] [L46] CALL assume(var4 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5] [L50] CALL assume(var5 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7] [L54] CALL assume(var6 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1] [L58] CALL assume(var7 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6] [L62] CALL assume(var8 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 0) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L66] CALL assume(var9 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 9) VAL [dummy=0, var0=2, var1=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L70] CALL assume(var10 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L74] CALL assume(var11 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L78] CALL assume(var12 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L82] CALL assume(var13 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L86] CALL assume(var14 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var15 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L90] CALL assume(var15 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var15 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var16 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L94] CALL assume(var16 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var16 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L95] int var17; [L96] var17 = __VERIFIER_nondet_int() [L97] CALL assume(var17 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var17 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L98] CALL assume(var17 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var17 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L99] int var18; [L100] var18 = __VERIFIER_nondet_int() [L101] CALL assume(var18 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var18 >= 1) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L102] CALL assume(var18 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var18 <= 9) VAL [dummy=0, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L103] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L104] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L105] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L106] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L107] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L108] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L109] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L110] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L111] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var0 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L112] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var0 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L113] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L114] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L115] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L116] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L117] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L118] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L119] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var1 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L120] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var1 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L121] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L122] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L123] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L124] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L125] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L126] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var2 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L127] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var2 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L128] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L129] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L130] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L131] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L132] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var3 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L133] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var3 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L134] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L135] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L136] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L137] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L137] RET assume(var4 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L138] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L138] RET assume(var4 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L139] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L140] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L141] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L141] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L142] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L142] RET assume(var5 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L143] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L144] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L145] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L145] RET assume(var6 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L146] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L147] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L148] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L149] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L150] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L150] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L151] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L152] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L153] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L153] RET assume(var10 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L154] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L154] RET assume(var10 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L155] CALL assume(var10 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var10 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L156] CALL assume(var10 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var10 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L157] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L157] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L158] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L159] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L160] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var11 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L161] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L161] RET assume(var11 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L162] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L162] RET assume(var11 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L163] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var11 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L164] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L165] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L165] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L166] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L166] RET assume(var12 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L167] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var12 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L168] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var12 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L169] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L169] RET assume(var12 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L170] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L170] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L171] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var13 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L172] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var13 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L173] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L173] RET assume(var13 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L174] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L174] RET assume(var13 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L175] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var14 != var15) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L176] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var14 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L177] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L177] RET assume(var14 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L178] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L178] RET assume(var14 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L179] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var15 != var16) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L180] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var15 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L181] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L181] RET assume(var15 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L182] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L182] RET assume(var16 != var17) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L183] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var16 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L184] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var17 != var18) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3] [L185] int var_for_abs; [L186] var_for_abs = var0 - var1 [L187] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=7] [L188] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=7] [L189] var_for_abs = var1 - var2 [L190] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=9] [L191] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=9] [L192] var_for_abs = var2 - var3 [L193] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=8] [L194] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L194] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=8] [L195] var_for_abs = var3 - var4 [L196] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=4] [L197] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L197] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=4] [L198] var_for_abs = var4 - var5 [L199] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=1] [L200] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=1] [L201] var_for_abs = var5 - var6 [L202] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=2] [L203] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var15 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=2] [L204] var_for_abs = var6 - var7 [L205] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=6] [L206] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L206] RET assume(var16 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=6] [L207] var_for_abs = var7 - var8 [L208] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=5] [L209] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L209] RET assume(var17 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=5] [L210] var_for_abs = var8 - var9 [L211] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=3] [L212] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var18 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=3] [L213] reach_error() VAL [dummy=0, myvar0=1, var0=2, var1=9, var10=7, var11=9, var12=8, var13=4, var14=1, var15=2, var16=6, var17=5, var18=3, var2=0, var3=8, var4=4, var5=5, var6=7, var7=1, var8=6, var9=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 2, TraceHistogramMax: 128, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 290 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 23.9s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 670 ConstructedInterpolants, 0 QuantifiedInterpolants, 670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 32512/32512 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-11-20 12:10:05,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852d5ee5-d1a9-494a-95a1-ead867ef9134/bin/uautomizer-ug76WZFUDN/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