./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/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_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-008.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/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_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- 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 10:41:16,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:41:16,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:41:16,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:41:16,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:41:16,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:41:16,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:41:16,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:41:17,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:41:17,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:41:17,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:41:17,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:41:17,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:41:17,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:41:17,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:41:17,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:41:17,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:41:17,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:41:17,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:41:17,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:41:17,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:41:17,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:41:17,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:41:17,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:41:17,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:41:17,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:41:17,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:41:17,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:41:17,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:41:17,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:41:17,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:41:17,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:41:17,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:41:17,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:41:17,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:41:17,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:41:17,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:41:17,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:41:17,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:41:17,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:41:17,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:41:17,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:41:17,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:41:17,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:41:17,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:41:17,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:41:17,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:41:17,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:41:17,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:41:17,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:41:17,104 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:41:17,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:41:17,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:41:17,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:41:17,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:41:17,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:41:17,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:41:17,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:41:17,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:41:17,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:41:17,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:41:17,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:41:17,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:41:17,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:41:17,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:41:17,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:41:17,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:41:17,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:41:17,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:41:17,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:41:17,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:41:17,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:41:17,112 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:41:17,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:41:17,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:41:17,113 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_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/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_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2022-11-20 10:41:17,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:41:17,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:41:17,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:41:17,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:41:17,448 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:41:17,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/xcsp/AllInterval-008.c [2022-11-20 10:41:20,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:41:20,808 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:41:20,809 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/sv-benchmarks/c/xcsp/AllInterval-008.c [2022-11-20 10:41:20,822 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/data/6bacbd3bb/2038e716624e4ed0bad0a9dc8413ac8c/FLAG14871e2e4 [2022-11-20 10:41:20,843 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/data/6bacbd3bb/2038e716624e4ed0bad0a9dc8413ac8c [2022-11-20 10:41:20,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:41:20,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:41:20,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:41:20,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:41:20,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:41:20,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:41:20" (1/1) ... [2022-11-20 10:41:20,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2f3edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:20, skipping insertion in model container [2022-11-20 10:41:20,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:41:20" (1/1) ... [2022-11-20 10:41:20,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:41:20,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:41:21,117 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_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2022-11-20 10:41:21,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:41:21,132 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:41:21,166 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_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2022-11-20 10:41:21,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:41:21,180 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:41:21,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21 WrapperNode [2022-11-20 10:41:21,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:41:21,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:41:21,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:41:21,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:41:21,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,224 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 178 [2022-11-20 10:41:21,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:41:21,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:41:21,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:41:21,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:41:21,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,263 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:41:21,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:41:21,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:41:21,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:41:21,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (1/1) ... [2022-11-20 10:41:21,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:41:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:41:21,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:41:21,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:41:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:41:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:41:21,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:41:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:41:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-11-20 10:41:21,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-11-20 10:41:21,442 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:41:21,445 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:41:21,804 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:41:21,812 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:41:21,812 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:41:21,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:21 BoogieIcfgContainer [2022-11-20 10:41:21,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:41:21,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:41:21,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:41:21,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:41:21,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:41:20" (1/3) ... [2022-11-20 10:41:21,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384f34f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:41:21, skipping insertion in model container [2022-11-20 10:41:21,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:41:21" (2/3) ... [2022-11-20 10:41:21,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384f34f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:41:21, skipping insertion in model container [2022-11-20 10:41:21,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:21" (3/3) ... [2022-11-20 10:41:21,823 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2022-11-20 10:41:21,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:41:21,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:41:21,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:41:21,993 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;@47856474, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:41:21,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:41:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-20 10:41:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2022-11-20 10:41:22,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:22,063 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:41:22,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1564691013, now seen corresponding path program 1 times [2022-11-20 10:41:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:22,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355350543] [2022-11-20 10:41:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:41:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:41:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:41:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:41:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 10:41:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-20 10:41:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 10:41:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:41:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:41:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:41:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 10:41:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 10:41:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 10:41:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:41:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:41:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 10:41:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 10:41:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 10:41:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 10:41:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 10:41:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 10:41:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 10:41:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 10:41:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 10:41:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-20 10:41:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 10:41:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 10:41:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 10:41:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 10:41:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:41:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-20 10:41:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-20 10:41:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 10:41:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-20 10:41:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-20 10:41:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-20 10:41:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-20 10:41:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-20 10:41:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-20 10:41:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-20 10:41:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 10:41:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-20 10:41:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-20 10:41:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-20 10:41:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-20 10:41:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-20 10:41:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-20 10:41:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-20 10:41:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-20 10:41:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-20 10:41:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-11-20 10:41:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-20 10:41:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-20 10:41:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 10:41:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-11-20 10:41:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-20 10:41:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-20 10:41:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-20 10:41:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-20 10:41:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-11-20 10:41:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-11-20 10:41:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-11-20 10:41:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-11-20 10:41:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-11-20 10:41:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-11-20 10:41:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-11-20 10:41:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2022-11-20 10:41:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-11-20 10:41:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-11-20 10:41:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-11-20 10:41:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2022-11-20 10:41:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2022-11-20 10:41:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-20 10:41:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-11-20 10:41:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-11-20 10:41:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-11-20 10:41:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2022-11-20 10:41:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-11-20 10:41:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-11-20 10:41:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-11-20 10:41:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-11-20 10:41:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2022-11-20 10:41:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-11-20 10:41:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2022-11-20 10:41:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2022-11-20 10:41:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-11-20 10:41:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:41:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2022-11-20 10:41:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:41:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355350543] [2022-11-20 10:41:23,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355350543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:41:23,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:41:23,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:41:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57887917] [2022-11-20 10:41:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:41:23,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:41:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:41:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:41:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:41:23,113 INFO L87 Difference]: Start difference. First operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2022-11-20 10:41:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:41:23,198 INFO L93 Difference]: Finished difference Result 232 states and 488 transitions. [2022-11-20 10:41:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:41:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 455 [2022-11-20 10:41:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:41:23,215 INFO L225 Difference]: With dead ends: 232 [2022-11-20 10:41:23,215 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 10:41:23,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 260 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 10:41:23,232 INFO L413 NwaCegarLoop]: 200 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, 200 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 10:41:23,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:41:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 10:41:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-20 10:41:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 28 states have (on average 1.0) internal successors, (28), 28 states have internal predecessors, (28), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-20 10:41:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 200 transitions. [2022-11-20 10:41:23,334 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 200 transitions. Word has length 455 [2022-11-20 10:41:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:41:23,337 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 200 transitions. [2022-11-20 10:41:23,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2022-11-20 10:41:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 200 transitions. [2022-11-20 10:41:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2022-11-20 10:41:23,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:41:23,357 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:41:23,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:41:23,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:41:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:41:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1305604715, now seen corresponding path program 1 times [2022-11-20 10:41:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:41:23,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759192626] [2022-11-20 10:41:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:41:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:41:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:41:25,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:41:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:41:27,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:41:27,229 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:41:27,231 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:41:27,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:41:27,237 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 10:41:27,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:41:27,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:41:27 BoogieIcfgContainer [2022-11-20 10:41:27,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:41:27,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:41:27,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:41:27,443 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:41:27,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:41:21" (3/4) ... [2022-11-20 10:41:27,445 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:41:27,607 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:41:27,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:41:27,608 INFO L158 Benchmark]: Toolchain (without parser) took 6760.78ms. Allocated memory was 138.4MB in the beginning and 272.6MB in the end (delta: 134.2MB). Free memory was 93.5MB in the beginning and 174.3MB in the end (delta: -80.8MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,609 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 98.6MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:41:27,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.46ms. Allocated memory is still 138.4MB. Free memory was 93.0MB in the beginning and 80.9MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.63ms. Allocated memory is still 138.4MB. Free memory was 80.9MB in the beginning and 78.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,610 INFO L158 Benchmark]: Boogie Preprocessor took 41.39ms. Allocated memory is still 138.4MB. Free memory was 78.8MB in the beginning and 77.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,610 INFO L158 Benchmark]: RCFGBuilder took 547.33ms. Allocated memory is still 138.4MB. Free memory was 77.3MB in the beginning and 59.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,610 INFO L158 Benchmark]: TraceAbstraction took 5624.82ms. Allocated memory was 138.4MB in the beginning and 272.6MB in the end (delta: 134.2MB). Free memory was 59.0MB in the beginning and 189.4MB in the end (delta: -130.4MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,611 INFO L158 Benchmark]: Witness Printer took 165.29ms. Allocated memory is still 272.6MB. Free memory was 189.4MB in the beginning and 174.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 10:41:27,613 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.29ms. Allocated memory is still 98.6MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.46ms. Allocated memory is still 138.4MB. Free memory was 93.0MB in the beginning and 80.9MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.63ms. Allocated memory is still 138.4MB. Free memory was 80.9MB in the beginning and 78.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.39ms. Allocated memory is still 138.4MB. Free memory was 78.8MB in the beginning and 77.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.33ms. Allocated memory is still 138.4MB. Free memory was 77.3MB in the beginning and 59.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5624.82ms. Allocated memory was 138.4MB in the beginning and 272.6MB in the end (delta: 134.2MB). Free memory was 59.0MB in the beginning and 189.4MB in the end (delta: -130.4MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Witness Printer took 165.29ms. Allocated memory is still 272.6MB. Free memory was 189.4MB in the beginning and 174.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. 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: 159]: 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 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 7) 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=6] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 7) VAL [dummy=0, var0=2, var1=6] [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=6, var2=3] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3] [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=6, var2=3, var3=1] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1] [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=6, var2=3, var3=1, var4=7] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7] [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=6, var2=3, var3=1, var4=7, var5=0] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0] [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=6, var2=3, var3=1, var4=7, var5=0, var6=5] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0, var6=5] [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=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 7) VAL [dummy=0, var0=2, var1=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, 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=6, var10=2, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 7) VAL [dummy=0, var0=2, var1=6, var10=2, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, 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=6, var10=2, var11=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 7) VAL [dummy=0, var0=2, var1=6, var10=2, var11=6, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, 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=6, var10=2, var11=6, var12=7, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 7) VAL [dummy=0, var0=2, var1=6, var10=2, var11=6, var12=7, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, 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=6, var10=2, var11=6, var12=7, var13=5, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 7) VAL [dummy=0, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, 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=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 7) VAL [dummy=0, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L87] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var8 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var8 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var9 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var9 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=4] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=4] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=3] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=3] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=2] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=2] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=6] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=6] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=7] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=7] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=5] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=5] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=1] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=1] [L159] reach_error() VAL [dummy=0, myvar0=1, var0=2, var1=6, var10=2, var11=6, var12=7, var13=5, var14=1, var2=3, var3=1, var4=7, var5=0, var6=5, var7=4, var8=4, var9=3, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 2, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 200 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, 200 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred 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.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14620/14620 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 10:41:27,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a8be9f-d75b-4f60-b4a7-3cd1e3fd2d3f/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