./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce365c5fd61effc2e95c898beace82398b56e664 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:25:26,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:25:26,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:25:26,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:25:26,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:25:26,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:25:26,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:25:26,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:25:26,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:25:26,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:25:26,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:25:26,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:25:26,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:25:26,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:25:26,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:25:26,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:25:26,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:25:26,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:25:26,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:25:26,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:25:26,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:25:26,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:25:26,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:25:26,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:25:26,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:25:26,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:25:26,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:25:26,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:25:26,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:25:26,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:25:26,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:25:26,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:25:26,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:25:26,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:25:26,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:25:26,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:25:26,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:25:26,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:25:26,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:25:26,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:25:26,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:25:26,967 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:25:26,991 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:25:26,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:25:26,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:25:26,993 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:25:26,993 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:25:26,994 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:25:26,994 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:25:26,994 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:25:26,995 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:25:26,995 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:25:26,995 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:25:26,996 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:25:26,996 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:25:26,997 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:25:26,997 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:25:26,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:25:26,998 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:25:26,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:25:26,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:25:26,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:25:27,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:25:27,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:25:27,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:25:27,001 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:25:27,001 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:25:27,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:25:27,002 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:25:27,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:25:27,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:25:27,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:25:27,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:25:27,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:25:27,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:25:27,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:25:27,003 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:25:27,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:25:27,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:25:27,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:25:27,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:25:27,005 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/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_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI 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 -> Taipan 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 -> ce365c5fd61effc2e95c898beace82398b56e664 [2021-10-11 02:25:27,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:25:27,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:25:27,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:25:27,270 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:25:27,271 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:25:27,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c [2021-10-11 02:25:27,338 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/data/712f9aa4f/39b8bd0106934932bacd1aecdfe3c65f/FLAG50bfd7e3e [2021-10-11 02:25:27,907 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:25:27,908 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c [2021-10-11 02:25:27,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/data/712f9aa4f/39b8bd0106934932bacd1aecdfe3c65f/FLAG50bfd7e3e [2021-10-11 02:25:28,270 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/data/712f9aa4f/39b8bd0106934932bacd1aecdfe3c65f [2021-10-11 02:25:28,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:25:28,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:25:28,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:25:28,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:25:28,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:25:28,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0900b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28, skipping insertion in model container [2021-10-11 02:25:28,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:25:28,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:25:28,524 WARN L226 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_7d35a757-0e50-4006-a0f1-0ad31abacc2e/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586] [2021-10-11 02:25:28,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:25:28,545 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:25:28,557 WARN L226 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_7d35a757-0e50-4006-a0f1-0ad31abacc2e/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586] [2021-10-11 02:25:28,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:25:28,576 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:25:28,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28 WrapperNode [2021-10-11 02:25:28,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:25:28,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:25:28,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:25:28,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:25:28,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:25:28,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:25:28,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:25:28,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:25:28,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... [2021-10-11 02:25:28,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:25:28,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:25:28,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:25:28,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:25:28,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:25:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:25:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:25:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:25:28,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:25:29,321 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:25:29,321 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-10-11 02:25:29,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:29 BoogieIcfgContainer [2021-10-11 02:25:29,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:25:29,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:25:29,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:25:29,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:25:29,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:25:28" (1/3) ... [2021-10-11 02:25:29,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9e3e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:29, skipping insertion in model container [2021-10-11 02:25:29,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28" (2/3) ... [2021-10-11 02:25:29,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9e3e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:29, skipping insertion in model container [2021-10-11 02:25:29,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:29" (3/3) ... [2021-10-11 02:25:29,337 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound100.c [2021-10-11 02:25:29,351 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:25:29,356 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:25:29,367 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-11 02:25:29,402 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:25:29,402 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:25:29,403 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:25:29,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:25:29,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:25:29,403 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:25:29,403 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:25:29,403 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:25:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2021-10-11 02:25:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-11 02:25:29,423 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:29,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-11 02:25:29,425 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 98480205, now seen corresponding path program 1 times [2021-10-11 02:25:29,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:29,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95849182] [2021-10-11 02:25:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:29,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95849182] [2021-10-11 02:25:29,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:29,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:25:29,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550955670] [2021-10-11 02:25:29,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-10-11 02:25:29,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 02:25:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 02:25:29,640 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2021-10-11 02:25:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:29,657 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-10-11 02:25:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 02:25:29,658 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2021-10-11 02:25:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:29,681 INFO L225 Difference]: With dead ends: 25 [2021-10-11 02:25:29,681 INFO L226 Difference]: Without dead ends: 11 [2021-10-11 02:25:29,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 02:25:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-11 02:25:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-10-11 02:25:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-11 02:25:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-10-11 02:25:29,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2021-10-11 02:25:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:29,721 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-10-11 02:25:29,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-10-11 02:25:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2021-10-11 02:25:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-11 02:25:29,722 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:29,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-11 02:25:29,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:25:29,723 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 97621232, now seen corresponding path program 1 times [2021-10-11 02:25:29,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:29,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154535276] [2021-10-11 02:25:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:29,776 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:29,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535956075] [2021-10-11 02:25:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:29,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-11 02:25:29,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:29,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:30,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154535276] [2021-10-11 02:25:30,019 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:30,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535956075] [2021-10-11 02:25:30,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:30,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-11 02:25:30,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571661331] [2021-10-11 02:25:30,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:30,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:30,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:30,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:30,023 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2021-10-11 02:25:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:30,119 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-10-11 02:25:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:30,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2021-10-11 02:25:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:30,121 INFO L225 Difference]: With dead ends: 20 [2021-10-11 02:25:30,121 INFO L226 Difference]: Without dead ends: 18 [2021-10-11 02:25:30,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:25:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-10-11 02:25:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 9. [2021-10-11 02:25:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-11 02:25:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-10-11 02:25:30,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2021-10-11 02:25:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:30,126 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-10-11 02:25:30,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-10-11 02:25:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-11 02:25:30,127 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:30,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-11 02:25:30,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-11 02:25:30,353 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1268746775, now seen corresponding path program 1 times [2021-10-11 02:25:30,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:30,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960297667] [2021-10-11 02:25:30,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:30,366 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:30,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496823074] [2021-10-11 02:25:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:30,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-11 02:25:30,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:30,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:30,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960297667] [2021-10-11 02:25:30,497 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:30,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496823074] [2021-10-11 02:25:30,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:30,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-10-11 02:25:30,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935651515] [2021-10-11 02:25:30,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:30,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:30,500 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2021-10-11 02:25:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:30,531 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-10-11 02:25:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:30,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2021-10-11 02:25:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:30,532 INFO L225 Difference]: With dead ends: 23 [2021-10-11 02:25:30,533 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:25:30,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:25:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2021-10-11 02:25:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-11 02:25:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-10-11 02:25:30,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 6 [2021-10-11 02:25:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:30,544 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-10-11 02:25:30,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-10-11 02:25:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:25:30,545 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:30,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:30,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:30,753 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:30,754 INFO L82 PathProgramCache]: Analyzing trace with hash 546169794, now seen corresponding path program 1 times [2021-10-11 02:25:30,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:30,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676437122] [2021-10-11 02:25:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:30,772 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:30,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095659231] [2021-10-11 02:25:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:30,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-11 02:25:30,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:31,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:31,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676437122] [2021-10-11 02:25:31,126 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:31,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095659231] [2021-10-11 02:25:31,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:31,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-10-11 02:25:31,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881961087] [2021-10-11 02:25:31,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:25:31,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:25:31,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:31,128 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 11 states. [2021-10-11 02:25:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:31,281 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-10-11 02:25:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:31,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2021-10-11 02:25:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:31,283 INFO L225 Difference]: With dead ends: 19 [2021-10-11 02:25:31,283 INFO L226 Difference]: Without dead ends: 15 [2021-10-11 02:25:31,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:25:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-10-11 02:25:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-10-11 02:25:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-11 02:25:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-10-11 02:25:31,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2021-10-11 02:25:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:31,295 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-10-11 02:25:31,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:25:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-10-11 02:25:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:25:31,296 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:31,296 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2021-10-11 02:25:31,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:31,521 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1998402165, now seen corresponding path program 1 times [2021-10-11 02:25:31,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:31,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588605780] [2021-10-11 02:25:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:31,533 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:31,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72263194] [2021-10-11 02:25:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:31,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-11 02:25:31,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:31,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:31,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588605780] [2021-10-11 02:25:31,705 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:31,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72263194] [2021-10-11 02:25:31,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [942384220] [2021-10-11 02:25:31,732 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-10-11 02:25:31,732 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:31,739 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:25:31,746 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:25:31,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:25:31,926 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:25:32,569 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:25:32,814 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-10-11 02:25:32,984 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-10-11 02:25:33,287 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-10-11 02:25:33,448 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:33,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 02:25:33,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-10-11 02:25:33,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425992705] [2021-10-11 02:25:33,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-10-11 02:25:33,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-11 02:25:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:25:33,450 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2021-10-11 02:25:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:33,562 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2021-10-11 02:25:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-11 02:25:33,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2021-10-11 02:25:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:33,563 INFO L225 Difference]: With dead ends: 35 [2021-10-11 02:25:33,563 INFO L226 Difference]: Without dead ends: 31 [2021-10-11 02:25:33,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-11 02:25:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-10-11 02:25:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-10-11 02:25:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-10-11 02:25:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2021-10-11 02:25:33,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 14 [2021-10-11 02:25:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:33,572 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2021-10-11 02:25:33,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-10-11 02:25:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2021-10-11 02:25:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 02:25:33,573 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:33,574 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1] [2021-10-11 02:25:33,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:33,801 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 652162767, now seen corresponding path program 2 times [2021-10-11 02:25:33,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:33,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741585107] [2021-10-11 02:25:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:33,813 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:33,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224188837] [2021-10-11 02:25:33,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:33,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-11 02:25:33,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:33,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-11 02:25:33,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:34,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:34,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741585107] [2021-10-11 02:25:34,222 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:34,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224188837] [2021-10-11 02:25:34,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833306531] [2021-10-11 02:25:34,225 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-10-11 02:25:34,225 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:34,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:25:34,226 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:25:34,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:25:34,278 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:25:34,728 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:25:34,958 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-10-11 02:25:35,144 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-10-11 02:25:35,442 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-10-11 02:25:35,606 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:35,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 02:25:35,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-10-11 02:25:35,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945377986] [2021-10-11 02:25:35,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-10-11 02:25:35,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-11 02:25:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:25:35,609 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2021-10-11 02:25:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:35,900 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-10-11 02:25:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-11 02:25:35,901 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2021-10-11 02:25:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:35,905 INFO L225 Difference]: With dead ends: 67 [2021-10-11 02:25:35,905 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 02:25:35,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=366, Invalid=1040, Unknown=0, NotChecked=0, Total=1406 [2021-10-11 02:25:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 02:25:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-11 02:25:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 02:25:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2021-10-11 02:25:35,932 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 30 [2021-10-11 02:25:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:35,933 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2021-10-11 02:25:35,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-10-11 02:25:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2021-10-11 02:25:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-11 02:25:35,937 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:35,937 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1] [2021-10-11 02:25:36,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-10-11 02:25:36,153 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -43060905, now seen corresponding path program 3 times [2021-10-11 02:25:36,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:36,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248672624] [2021-10-11 02:25:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:36,165 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:36,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814353581] [2021-10-11 02:25:36,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:36,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:25:36,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:36,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjunts are in the unsatisfiable core [2021-10-11 02:25:36,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:36,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:37,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248672624] [2021-10-11 02:25:37,092 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:37,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814353581] [2021-10-11 02:25:37,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1155101632] [2021-10-11 02:25:37,096 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-10-11 02:25:37,099 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:37,099 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:25:37,099 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:25:37,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:25:37,154 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:25:37,475 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:25:37,721 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-10-11 02:25:37,879 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-10-11 02:25:38,221 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-10-11 02:25:38,403 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:38,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 02:25:38,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2021-10-11 02:25:38,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203610630] [2021-10-11 02:25:38,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-10-11 02:25:38,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-11 02:25:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=1113, Unknown=0, NotChecked=0, Total=1640 [2021-10-11 02:25:38,407 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2021-10-11 02:25:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:39,260 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2021-10-11 02:25:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-11 02:25:39,261 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2021-10-11 02:25:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:39,267 INFO L225 Difference]: With dead ends: 131 [2021-10-11 02:25:39,267 INFO L226 Difference]: Without dead ends: 127 [2021-10-11 02:25:39,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1470, Invalid=3360, Unknown=0, NotChecked=0, Total=4830 [2021-10-11 02:25:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-11 02:25:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-10-11 02:25:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-10-11 02:25:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2021-10-11 02:25:39,309 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 62 [2021-10-11 02:25:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:39,310 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2021-10-11 02:25:39,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-10-11 02:25:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2021-10-11 02:25:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-10-11 02:25:39,316 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:39,316 INFO L422 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1] [2021-10-11 02:25:39,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:39,533 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1163262361, now seen corresponding path program 4 times [2021-10-11 02:25:39,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:39,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188502333] [2021-10-11 02:25:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:39,547 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:39,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814870637] [2021-10-11 02:25:39,547 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:39,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 63 conjunts are in the unsatisfiable core [2021-10-11 02:25:39,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:40,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:42,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188502333] [2021-10-11 02:25:42,425 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:42,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814870637] [2021-10-11 02:25:42,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1795746427] [2021-10-11 02:25:42,432 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-10-11 02:25:42,432 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:42,433 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:25:42,433 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:25:42,433 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:25:42,462 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:25:42,834 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:25:43,224 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-10-11 02:25:43,524 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-10-11 02:25:43,696 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:43,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 02:25:43,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2021-10-11 02:25:43,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786235292] [2021-10-11 02:25:43,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-10-11 02:25:43,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-10-11 02:25:43,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=3209, Unknown=0, NotChecked=0, Total=5256 [2021-10-11 02:25:43,701 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 66 states. [2021-10-11 02:25:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:46,291 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2021-10-11 02:25:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-10-11 02:25:46,292 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 126 [2021-10-11 02:25:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:46,298 INFO L225 Difference]: With dead ends: 259 [2021-10-11 02:25:46,298 INFO L226 Difference]: Without dead ends: 255 [2021-10-11 02:25:46,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3309 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5982, Invalid=11840, Unknown=0, NotChecked=0, Total=17822 [2021-10-11 02:25:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-11 02:25:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-10-11 02:25:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2021-10-11 02:25:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2021-10-11 02:25:46,357 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 126 [2021-10-11 02:25:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:46,359 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2021-10-11 02:25:46,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2021-10-11 02:25:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2021-10-11 02:25:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-10-11 02:25:46,371 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:46,371 INFO L422 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 1, 1, 1, 1, 1] [2021-10-11 02:25:46,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:46,597 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1550929785, now seen corresponding path program 5 times [2021-10-11 02:25:46,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:46,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328429944] [2021-10-11 02:25:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:46,616 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:25:46,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374671305] [2021-10-11 02:25:46,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:47,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2021-10-11 02:25:47,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:47,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 127 conjunts are in the unsatisfiable core [2021-10-11 02:25:47,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:50,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:53,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328429944] [2021-10-11 02:25:53,811 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:53,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374671305] [2021-10-11 02:25:53,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1421320113] [2021-10-11 02:25:53,815 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-10-11 02:25:53,816 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:53,816 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:25:53,816 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:25:53,816 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:25:53,872 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:25:54,100 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:25:54,507 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-10-11 02:25:54,755 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-10-11 02:25:55,135 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-10-11 02:25:55,361 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:25:55,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 02:25:55,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 103 [2021-10-11 02:25:55,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033354983] [2021-10-11 02:25:55,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 104 states [2021-10-11 02:25:55,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-10-11 02:25:55,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5182, Invalid=7028, Unknown=0, NotChecked=0, Total=12210 [2021-10-11 02:25:55,368 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 104 states. [2021-10-11 02:26:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:00,809 INFO L93 Difference]: Finished difference Result 411 states and 448 transitions. [2021-10-11 02:26:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-10-11 02:26:00,810 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 254 [2021-10-11 02:26:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:00,814 INFO L225 Difference]: With dead ends: 411 [2021-10-11 02:26:00,815 INFO L226 Difference]: Without dead ends: 407 [2021-10-11 02:26:00,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 650 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7130 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15343, Invalid=28547, Unknown=0, NotChecked=0, Total=43890 [2021-10-11 02:26:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-10-11 02:26:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2021-10-11 02:26:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-10-11 02:26:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2021-10-11 02:26:00,861 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 254 [2021-10-11 02:26:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:00,863 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2021-10-11 02:26:00,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2021-10-11 02:26:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2021-10-11 02:26:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2021-10-11 02:26:00,873 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:00,874 INFO L422 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 1, 1, 1, 1, 1] [2021-10-11 02:26:01,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2021-10-11 02:26:01,101 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash 849166733, now seen corresponding path program 6 times [2021-10-11 02:26:01,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:01,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687062795] [2021-10-11 02:26:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:01,141 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 02:26:01,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867942874] [2021-10-11 02:26:01,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:02,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:26:02,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 02:26:02,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:26:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:26:02,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:26:06,581 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:26:06,581 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:26:06,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:07,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:26:07 BoogieIcfgContainer [2021-10-11 02:26:07,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:26:07,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:26:07,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:26:07,003 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:26:07,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:29" (3/4) ... [2021-10-11 02:26:07,005 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:26:07,255 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d35a757-0e50-4006-a0f1-0ad31abacc2e/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:26:07,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:26:07,256 INFO L168 Benchmark]: Toolchain (without parser) took 38981.26 ms. Allocated memory was 140.5 MB in the beginning and 520.1 MB in the end (delta: 379.6 MB). Free memory was 110.2 MB in the beginning and 290.5 MB in the end (delta: -180.3 MB). Peak memory consumption was 199.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:07,256 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 86.0 MB. Free memory was 42.2 MB in the beginning and 42.1 MB in the end (delta: 40.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:26:07,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.60 ms. Allocated memory is still 140.5 MB. Free memory was 109.8 MB in the beginning and 117.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:07,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.59 ms. Allocated memory is still 140.5 MB. Free memory was 117.1 MB in the beginning and 115.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:07,262 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 140.5 MB. Free memory was 115.8 MB in the beginning and 114.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:26:07,263 INFO L168 Benchmark]: RCFGBuilder took 691.76 ms. Allocated memory is still 140.5 MB. Free memory was 114.3 MB in the beginning and 94.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:07,263 INFO L168 Benchmark]: TraceAbstraction took 37672.46 ms. Allocated memory was 140.5 MB in the beginning and 520.1 MB in the end (delta: 379.6 MB). Free memory was 93.7 MB in the beginning and 320.9 MB in the end (delta: -227.2 MB). Peak memory consumption was 154.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:07,263 INFO L168 Benchmark]: Witness Printer took 252.68 ms. Allocated memory is still 520.1 MB. Free memory was 320.9 MB in the beginning and 290.5 MB in the end (delta: 30.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:07,266 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.22 ms. Allocated memory is still 86.0 MB. Free memory was 42.2 MB in the beginning and 42.1 MB in the end (delta: 40.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 296.60 ms. Allocated memory is still 140.5 MB. Free memory was 109.8 MB in the beginning and 117.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.59 ms. Allocated memory is still 140.5 MB. Free memory was 117.1 MB in the beginning and 115.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 140.5 MB. Free memory was 115.8 MB in the beginning and 114.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 691.76 ms. Allocated memory is still 140.5 MB. Free memory was 114.3 MB in the beginning and 94.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 37672.46 ms. Allocated memory was 140.5 MB in the beginning and 520.1 MB in the end (delta: 379.6 MB). Free memory was 93.7 MB in the beginning and 320.9 MB in the end (delta: -227.2 MB). Peak memory consumption was 154.5 MB. Max. memory is 16.1 GB. * Witness Printer took 252.68 ms. Allocated memory is still 520.1 MB. Free memory was 320.9 MB in the beginning and 290.5 MB in the end (delta: 30.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L13] COND FALSE !(!cond) [L13] COND FALSE !(!cond) [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0] [L36] EXPR counter++ VAL [counter=1] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=1] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=1] [L36] EXPR counter++ VAL [counter=2] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=2] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=2] [L36] EXPR counter++ VAL [counter=3] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=3] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=3] [L36] EXPR counter++ VAL [counter=4] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=4] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=4] [L36] EXPR counter++ VAL [counter=5] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=5] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=5] [L36] EXPR counter++ VAL [counter=6] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=6] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=6] [L36] EXPR counter++ VAL [counter=7] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=7] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=7] [L36] EXPR counter++ VAL [counter=8] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=8] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=8] [L36] EXPR counter++ VAL [counter=9] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=9] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=9] [L36] EXPR counter++ VAL [counter=10] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=10] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=10] [L36] EXPR counter++ VAL [counter=11] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=11] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=11] [L36] EXPR counter++ VAL [counter=12] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=12] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=12] [L36] EXPR counter++ VAL [counter=13] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=13] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=13] [L36] EXPR counter++ VAL [counter=14] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=14] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=14] [L36] EXPR counter++ VAL [counter=15] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=15] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=15] [L36] EXPR counter++ VAL [counter=16] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=16] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=16] [L36] EXPR counter++ VAL [counter=17] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=17] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=17] [L36] EXPR counter++ VAL [counter=18] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=18] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=18] [L36] EXPR counter++ VAL [counter=19] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=19] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=19] [L36] EXPR counter++ VAL [counter=20] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=20] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=20] [L36] EXPR counter++ VAL [counter=21] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=21] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=21] [L36] EXPR counter++ VAL [counter=22] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=22] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=22] [L36] EXPR counter++ VAL [counter=23] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=23] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=23] [L36] EXPR counter++ VAL [counter=24] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=24] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=24] [L36] EXPR counter++ VAL [counter=25] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=25] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=25] [L36] EXPR counter++ VAL [counter=26] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=26] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=26] [L36] EXPR counter++ VAL [counter=27] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=27] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=27] [L36] EXPR counter++ VAL [counter=28] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=28] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=28] [L36] EXPR counter++ VAL [counter=29] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=29] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=29] [L36] EXPR counter++ VAL [counter=30] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=30] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=30] [L36] EXPR counter++ VAL [counter=31] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=31] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=31] [L36] EXPR counter++ VAL [counter=32] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=32] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=32] [L36] EXPR counter++ VAL [counter=33] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=33] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=33] [L36] EXPR counter++ VAL [counter=34] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=34] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=34] [L36] EXPR counter++ VAL [counter=35] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=35] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=35] [L36] EXPR counter++ VAL [counter=36] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=36] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=36] [L36] EXPR counter++ VAL [counter=37] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=37] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=37] [L36] EXPR counter++ VAL [counter=38] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=38] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=38] [L36] EXPR counter++ VAL [counter=39] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=39] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=39] [L36] EXPR counter++ VAL [counter=40] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=40] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=40] [L36] EXPR counter++ VAL [counter=41] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=41] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=41] [L36] EXPR counter++ VAL [counter=42] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=42] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=42] [L36] EXPR counter++ VAL [counter=43] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=43] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=43] [L36] EXPR counter++ VAL [counter=44] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=44] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=44] [L36] EXPR counter++ VAL [counter=45] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=45] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=45] [L36] EXPR counter++ VAL [counter=46] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=46] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=46] [L36] EXPR counter++ VAL [counter=47] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=47] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=47] [L36] EXPR counter++ VAL [counter=48] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=48] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=48] [L36] EXPR counter++ VAL [counter=49] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=49] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=49] [L36] EXPR counter++ VAL [counter=50] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=50] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=50] [L36] EXPR counter++ VAL [counter=51] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=51] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=51] [L36] EXPR counter++ VAL [counter=52] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=52] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=52] [L36] EXPR counter++ VAL [counter=53] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=53] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=53] [L36] EXPR counter++ VAL [counter=54] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=54] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=54] [L36] EXPR counter++ VAL [counter=55] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=55] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=55] [L36] EXPR counter++ VAL [counter=56] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=56] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=56] [L36] EXPR counter++ VAL [counter=57] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=57] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=57] [L36] EXPR counter++ VAL [counter=58] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=58] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=58] [L36] EXPR counter++ VAL [counter=59] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=59] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=59] [L36] EXPR counter++ VAL [counter=60] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=60] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=60] [L36] EXPR counter++ VAL [counter=61] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=61] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=61] [L36] EXPR counter++ VAL [counter=62] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=62] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=62] [L36] EXPR counter++ VAL [counter=63] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=63] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=63] [L36] EXPR counter++ VAL [counter=64] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=64] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=64] [L36] EXPR counter++ VAL [counter=65] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=65] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=65] [L36] EXPR counter++ VAL [counter=66] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=66] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=66] [L36] EXPR counter++ VAL [counter=67] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=67] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=67] [L36] EXPR counter++ VAL [counter=68] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=68] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=68] [L36] EXPR counter++ VAL [counter=69] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=69] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=69] [L36] EXPR counter++ VAL [counter=70] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=70] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=70] [L36] EXPR counter++ VAL [counter=71] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=71] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=71] [L36] EXPR counter++ VAL [counter=72] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=72] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=72] [L36] EXPR counter++ VAL [counter=73] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=73] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=73] [L36] EXPR counter++ VAL [counter=74] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=74] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=74] [L36] EXPR counter++ VAL [counter=75] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=75] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=75] [L36] EXPR counter++ VAL [counter=76] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=76] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=76] [L36] EXPR counter++ VAL [counter=77] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=77] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=77] [L36] EXPR counter++ VAL [counter=78] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=78] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=78] [L36] EXPR counter++ VAL [counter=79] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=79] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=79] [L36] EXPR counter++ VAL [counter=80] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=80] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=80] [L36] EXPR counter++ VAL [counter=81] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=81] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=81] [L36] EXPR counter++ VAL [counter=82] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=82] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=82] [L36] EXPR counter++ VAL [counter=83] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=83] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=83] [L36] EXPR counter++ VAL [counter=84] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=84] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=84] [L36] EXPR counter++ VAL [counter=85] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=85] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=85] [L36] EXPR counter++ VAL [counter=86] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=86] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=86] [L36] EXPR counter++ VAL [counter=87] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=87] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=87] [L36] EXPR counter++ VAL [counter=88] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=88] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=88] [L36] EXPR counter++ VAL [counter=89] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=89] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=89] [L36] EXPR counter++ VAL [counter=90] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=90] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=90] [L36] EXPR counter++ VAL [counter=91] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=91] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=91] [L36] EXPR counter++ VAL [counter=92] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=92] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=92] [L36] EXPR counter++ VAL [counter=93] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=93] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=93] [L36] EXPR counter++ VAL [counter=94] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=94] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=94] [L36] EXPR counter++ VAL [counter=95] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=95] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=95] [L36] EXPR counter++ VAL [counter=96] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=96] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=96] [L36] EXPR counter++ VAL [counter=97] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=97] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=97] [L36] EXPR counter++ VAL [counter=98] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=98] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=98] [L36] EXPR counter++ VAL [counter=99] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=99] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=99] [L36] EXPR counter++ VAL [counter=100] [L36] COND TRUE counter++<100 [L16] COND FALSE !(!(cond)) VAL [counter=100] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=100] [L36] EXPR counter++ VAL [counter=101] [L36] COND FALSE !(counter++<100) [L16] COND TRUE !(cond) VAL [counter=101] [L18] reach_error() VAL [counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 37.3s, OverallIterations: 10, TraceHistogramMax: 101, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 SDtfs, 162 SDslu, 585 SDs, 0 SdLazy, 519 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1695 GetRequests, 1208 SyntacticMatches, 1 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11881 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=9, 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, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 916 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 998 ConstructedInterpolants, 0 QuantifiedInterpolants, 501563 SizeOfPredicates, 136 NumberOfNonLiveVariables, 1863 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 0/19920 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! Received shutdown request...