./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/gcd02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/gcd02.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH --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 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:19:30,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:19:30,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:19:30,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:19:30,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:19:30,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:19:30,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:19:30,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:19:30,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:19:30,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:19:30,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:19:30,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:19:30,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:19:30,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:19:30,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:19:30,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:19:30,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:19:30,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:19:30,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:19:30,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:19:30,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:19:30,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:19:30,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:19:30,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:19:30,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:19:30,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:19:30,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:19:30,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:19:30,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:19:30,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:19:30,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:19:30,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:19:30,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:19:30,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:19:30,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:19:30,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:19:30,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:19:30,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:19:30,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:19:30,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:19:30,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:19:30,948 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:19:30,997 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:19:30,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:19:30,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:19:30,998 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:19:30,999 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:19:30,999 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:19:30,999 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:19:30,999 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:19:30,999 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:19:31,000 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:19:31,000 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:19:31,000 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:19:31,000 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:19:31,000 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:19:31,001 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:19:31,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:19:31,002 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:19:31,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:19:31,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:19:31,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:19:31,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:19:31,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:19:31,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:19:31,009 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:19:31,010 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:19:31,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:19:31,010 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:19:31,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:19:31,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:19:31,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:19:31,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:19:31,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:19:31,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:19:31,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:19:31,014 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:19:31,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:19:31,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:19:31,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:19:31,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:19:31,016 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_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/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_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH 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 -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 [2021-11-03 04:19:31,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:19:31,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:19:31,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:19:31,380 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:19:31,381 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:19:31,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/recursive/gcd02.c [2021-11-03 04:19:31,462 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/data/9e631cf25/0ab07990d1c04e0a91d1882265bed1ed/FLAGd850f1a1a [2021-11-03 04:19:31,931 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:19:31,932 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/sv-benchmarks/c/recursive/gcd02.c [2021-11-03 04:19:31,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/data/9e631cf25/0ab07990d1c04e0a91d1882265bed1ed/FLAGd850f1a1a [2021-11-03 04:19:32,356 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/data/9e631cf25/0ab07990d1c04e0a91d1882265bed1ed [2021-11-03 04:19:32,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:19:32,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:19:32,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:19:32,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:19:32,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:19:32,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56608452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32, skipping insertion in model container [2021-11-03 04:19:32,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:19:32,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:19:32,529 WARN L228 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_0e7d348a-aeb4-4beb-8112-a20c8212282a/sv-benchmarks/c/recursive/gcd02.c[623,636] [2021-11-03 04:19:32,540 WARN L228 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_0e7d348a-aeb4-4beb-8112-a20c8212282a/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2021-11-03 04:19:32,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:19:32,549 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:19:32,559 WARN L228 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_0e7d348a-aeb4-4beb-8112-a20c8212282a/sv-benchmarks/c/recursive/gcd02.c[623,636] [2021-11-03 04:19:32,564 WARN L228 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_0e7d348a-aeb4-4beb-8112-a20c8212282a/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2021-11-03 04:19:32,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:19:32,578 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:19:32,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32 WrapperNode [2021-11-03 04:19:32,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:19:32,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:19:32,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:19:32,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:19:32,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:19:32,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:19:32,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:19:32,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:19:32,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:19:32,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:19:32,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:19:32,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:19:32,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (1/1) ... [2021-11-03 04:19:32,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:19:32,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:32,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:19:32,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:19:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2021-11-03 04:19:32,700 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2021-11-03 04:19:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:19:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:19:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2021-11-03 04:19:32,700 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2021-11-03 04:19:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:19:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:19:32,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:19:32,946 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 04:19:32,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:19:32 BoogieIcfgContainer [2021-11-03 04:19:32,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:19:32,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:19:32,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:19:32,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:19:32,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:19:32" (1/3) ... [2021-11-03 04:19:32,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126ebd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:19:32, skipping insertion in model container [2021-11-03 04:19:32,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:19:32" (2/3) ... [2021-11-03 04:19:32,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126ebd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:19:32, skipping insertion in model container [2021-11-03 04:19:32,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:19:32" (3/3) ... [2021-11-03 04:19:32,959 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd02.c [2021-11-03 04:19:32,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:19:32,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-03 04:19:33,021 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:19:33,028 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:19:33,029 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-03 04:19:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-03 04:19:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 04:19:33,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:33,049 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:33,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1549950046, now seen corresponding path program 1 times [2021-11-03 04:19:33,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:33,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071398475] [2021-11-03 04:19:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:33,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:19:33,288 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:33,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071398475] [2021-11-03 04:19:33,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071398475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:33,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:33,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:19:33,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670991319] [2021-11-03 04:19:33,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:19:33,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:19:33,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:19:33,312 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:19:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:33,425 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2021-11-03 04:19:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:19:33,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-03 04:19:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:33,437 INFO L225 Difference]: With dead ends: 73 [2021-11-03 04:19:33,437 INFO L226 Difference]: Without dead ends: 40 [2021-11-03 04:19:33,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:19:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-03 04:19:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-11-03 04:19:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-03 04:19:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-11-03 04:19:33,504 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 8 [2021-11-03 04:19:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:33,505 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-11-03 04:19:33,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:19:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2021-11-03 04:19:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:19:33,507 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:33,508 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:33,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:19:33,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1756513854, now seen corresponding path program 1 times [2021-11-03 04:19:33,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:33,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991284277] [2021-11-03 04:19:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:33,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:19:33,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:33,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991284277] [2021-11-03 04:19:33,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991284277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:33,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:33,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:19:33,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264946023] [2021-11-03 04:19:33,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 04:19:33,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 04:19:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:19:33,671 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:19:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:33,790 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2021-11-03 04:19:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 04:19:33,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 04:19:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:33,798 INFO L225 Difference]: With dead ends: 58 [2021-11-03 04:19:33,798 INFO L226 Difference]: Without dead ends: 56 [2021-11-03 04:19:33,800 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:19:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-03 04:19:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2021-11-03 04:19:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:19:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2021-11-03 04:19:33,847 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 13 [2021-11-03 04:19:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:33,848 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2021-11-03 04:19:33,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:19:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2021-11-03 04:19:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:19:33,849 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:33,849 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:33,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:19:33,850 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1759343999, now seen corresponding path program 1 times [2021-11-03 04:19:33,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:33,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381662540] [2021-11-03 04:19:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:33,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:19:34,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:34,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381662540] [2021-11-03 04:19:34,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381662540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:34,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:34,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 04:19:34,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775891382] [2021-11-03 04:19:34,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:19:34,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:19:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:19:34,027 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:19:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:34,157 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2021-11-03 04:19:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:19:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 04:19:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:34,162 INFO L225 Difference]: With dead ends: 62 [2021-11-03 04:19:34,162 INFO L226 Difference]: Without dead ends: 60 [2021-11-03 04:19:34,163 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-11-03 04:19:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-03 04:19:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2021-11-03 04:19:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:19:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2021-11-03 04:19:34,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2021-11-03 04:19:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:34,199 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2021-11-03 04:19:34,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:19:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2021-11-03 04:19:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 04:19:34,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:34,204 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:34,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:19:34,205 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1880095371, now seen corresponding path program 1 times [2021-11-03 04:19:34,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:34,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471302460] [2021-11-03 04:19:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:34,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:19:34,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:34,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471302460] [2021-11-03 04:19:34,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471302460] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:34,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:34,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:19:34,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963013371] [2021-11-03 04:19:34,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:19:34,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:19:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:19:34,264 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-03 04:19:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:34,277 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2021-11-03 04:19:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:19:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-11-03 04:19:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:34,279 INFO L225 Difference]: With dead ends: 54 [2021-11-03 04:19:34,279 INFO L226 Difference]: Without dead ends: 50 [2021-11-03 04:19:34,279 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:19:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-03 04:19:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-11-03 04:19:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-11-03 04:19:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2021-11-03 04:19:34,287 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 19 [2021-11-03 04:19:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:34,288 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2021-11-03 04:19:34,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-03 04:19:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2021-11-03 04:19:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-03 04:19:34,290 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:34,290 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:34,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:19:34,290 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1134762375, now seen corresponding path program 1 times [2021-11-03 04:19:34,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:34,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270967871] [2021-11-03 04:19:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:34,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:19:34,388 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:34,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270967871] [2021-11-03 04:19:34,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270967871] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:34,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:34,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 04:19:34,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284335708] [2021-11-03 04:19:34,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 04:19:34,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 04:19:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:19:34,391 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 04:19:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:34,534 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2021-11-03 04:19:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:19:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-11-03 04:19:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:34,541 INFO L225 Difference]: With dead ends: 68 [2021-11-03 04:19:34,542 INFO L226 Difference]: Without dead ends: 64 [2021-11-03 04:19:34,542 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-03 04:19:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-03 04:19:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2021-11-03 04:19:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2021-11-03 04:19:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-11-03 04:19:34,563 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2021-11-03 04:19:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:34,564 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-11-03 04:19:34,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 04:19:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2021-11-03 04:19:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 04:19:34,566 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:34,566 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:34,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:19:34,566 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1512584049, now seen corresponding path program 1 times [2021-11-03 04:19:34,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:34,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490555517] [2021-11-03 04:19:34,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:34,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:19:34,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:34,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490555517] [2021-11-03 04:19:34,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490555517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:34,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:34,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:19:34,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628233294] [2021-11-03 04:19:34,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:19:34,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:19:34,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:19:34,673 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-03 04:19:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:34,693 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2021-11-03 04:19:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:19:34,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2021-11-03 04:19:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:34,697 INFO L225 Difference]: With dead ends: 63 [2021-11-03 04:19:34,697 INFO L226 Difference]: Without dead ends: 54 [2021-11-03 04:19:34,698 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:19:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-03 04:19:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-03 04:19:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2021-11-03 04:19:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2021-11-03 04:19:34,715 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 26 [2021-11-03 04:19:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:34,715 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2021-11-03 04:19:34,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-03 04:19:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2021-11-03 04:19:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-03 04:19:34,717 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:34,717 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:34,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:19:34,718 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -36939295, now seen corresponding path program 1 times [2021-11-03 04:19:34,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:34,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531793848] [2021-11-03 04:19:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:34,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:19:34,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:34,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531793848] [2021-11-03 04:19:34,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531793848] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:34,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830916608] [2021-11-03 04:19:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:34,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:34,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:34,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 04:19:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:35,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-03 04:19:35,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:19:35,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 04:19:35,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830916608] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:35,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160585652] [2021-11-03 04:19:35,805 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-11-03 04:19:35,805 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:35,810 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:35,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:35,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2021-11-03 04:19:35,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95751678] [2021-11-03 04:19:35,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 04:19:35,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:35,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 04:19:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-03 04:19:35,816 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-03 04:19:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:36,017 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2021-11-03 04:19:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:19:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 27 [2021-11-03 04:19:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:36,018 INFO L225 Difference]: With dead ends: 62 [2021-11-03 04:19:36,018 INFO L226 Difference]: Without dead ends: 54 [2021-11-03 04:19:36,019 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-11-03 04:19:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-03 04:19:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2021-11-03 04:19:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-03 04:19:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2021-11-03 04:19:36,026 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 27 [2021-11-03 04:19:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:36,026 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2021-11-03 04:19:36,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-03 04:19:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2021-11-03 04:19:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:19:36,028 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:36,028 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:36,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:36,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:36,252 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:36,253 INFO L85 PathProgramCache]: Analyzing trace with hash -645776947, now seen corresponding path program 1 times [2021-11-03 04:19:36,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:36,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605183011] [2021-11-03 04:19:36,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:36,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 04:19:36,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:36,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605183011] [2021-11-03 04:19:36,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605183011] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:36,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404095546] [2021-11-03 04:19:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:36,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:36,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:36,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 04:19:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:36,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-03 04:19:36,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 04:19:36,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:19:36,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404095546] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:36,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [475008762] [2021-11-03 04:19:36,980 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-03 04:19:36,980 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:36,981 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:36,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:36,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2021-11-03 04:19:36,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734827949] [2021-11-03 04:19:36,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 04:19:36,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 04:19:36,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-03 04:19:36,993 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-11-03 04:19:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:37,245 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2021-11-03 04:19:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:19:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 28 [2021-11-03 04:19:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:37,249 INFO L225 Difference]: With dead ends: 73 [2021-11-03 04:19:37,249 INFO L226 Difference]: Without dead ends: 69 [2021-11-03 04:19:37,250 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-11-03 04:19:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-03 04:19:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-11-03 04:19:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2021-11-03 04:19:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2021-11-03 04:19:37,261 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2021-11-03 04:19:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:37,261 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2021-11-03 04:19:37,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-11-03 04:19:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2021-11-03 04:19:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:19:37,263 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:37,263 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:37,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:37,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:37,491 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1157552339, now seen corresponding path program 1 times [2021-11-03 04:19:37,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:37,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66717121] [2021-11-03 04:19:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:37,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-03 04:19:37,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:37,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66717121] [2021-11-03 04:19:37,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66717121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:19:37,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:19:37,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 04:19:37,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237149248] [2021-11-03 04:19:37,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 04:19:37,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 04:19:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:19:37,618 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 04:19:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:37,765 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2021-11-03 04:19:37,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:19:37,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2021-11-03 04:19:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:37,767 INFO L225 Difference]: With dead ends: 79 [2021-11-03 04:19:37,767 INFO L226 Difference]: Without dead ends: 75 [2021-11-03 04:19:37,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-03 04:19:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-03 04:19:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2021-11-03 04:19:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2021-11-03 04:19:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2021-11-03 04:19:37,784 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 28 [2021-11-03 04:19:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:37,785 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2021-11-03 04:19:37,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 04:19:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2021-11-03 04:19:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-03 04:19:37,789 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:37,789 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:37,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:19:37,790 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash -730439667, now seen corresponding path program 1 times [2021-11-03 04:19:37,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:37,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585806157] [2021-11-03 04:19:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:37,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 04:19:37,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:37,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585806157] [2021-11-03 04:19:37,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585806157] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:37,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439964011] [2021-11-03 04:19:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:37,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:37,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:37,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 04:19:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:38,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-03 04:19:38,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:19:38,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 04:19:38,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439964011] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:38,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270648798] [2021-11-03 04:19:38,954 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:38,954 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:38,954 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:38,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:38,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2021-11-03 04:19:38,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948475906] [2021-11-03 04:19:38,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-03 04:19:38,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:38,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-03 04:19:38,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-11-03 04:19:38,958 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-03 04:19:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:39,223 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2021-11-03 04:19:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 04:19:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2021-11-03 04:19:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:39,225 INFO L225 Difference]: With dead ends: 88 [2021-11-03 04:19:39,225 INFO L226 Difference]: Without dead ends: 84 [2021-11-03 04:19:39,226 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-11-03 04:19:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-03 04:19:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2021-11-03 04:19:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (27), 17 states have call predecessors, (27), 11 states have call successors, (27) [2021-11-03 04:19:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2021-11-03 04:19:39,238 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 35 [2021-11-03 04:19:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:39,238 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2021-11-03 04:19:39,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-03 04:19:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2021-11-03 04:19:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-03 04:19:39,240 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:39,240 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:39,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-03 04:19:39,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:39,455 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1412671149, now seen corresponding path program 1 times [2021-11-03 04:19:39,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:39,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679575432] [2021-11-03 04:19:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:39,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:19:39,634 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:39,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679575432] [2021-11-03 04:19:39,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679575432] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:39,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367311154] [2021-11-03 04:19:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:39,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:39,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:39,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 04:19:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:39,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-03 04:19:39,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:19:40,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:19:40,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367311154] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:40,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163404266] [2021-11-03 04:19:40,410 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:40,410 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:40,411 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:40,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:40,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2021-11-03 04:19:40,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849219311] [2021-11-03 04:19:40,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 04:19:40,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 04:19:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-03 04:19:40,413 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-03 04:19:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:40,601 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2021-11-03 04:19:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 04:19:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2021-11-03 04:19:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:40,603 INFO L225 Difference]: With dead ends: 83 [2021-11-03 04:19:40,603 INFO L226 Difference]: Without dead ends: 74 [2021-11-03 04:19:40,603 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-11-03 04:19:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-03 04:19:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2021-11-03 04:19:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (26), 16 states have call predecessors, (26), 11 states have call successors, (26) [2021-11-03 04:19:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2021-11-03 04:19:40,612 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 35 [2021-11-03 04:19:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:40,613 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2021-11-03 04:19:40,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-03 04:19:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2021-11-03 04:19:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 04:19:40,614 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:40,614 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:40,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:40,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-03 04:19:40,827 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1675208857, now seen corresponding path program 1 times [2021-11-03 04:19:40,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:40,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390793668] [2021-11-03 04:19:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:40,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-03 04:19:40,975 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:40,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390793668] [2021-11-03 04:19:40,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390793668] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:40,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489533182] [2021-11-03 04:19:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:40,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:40,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:40,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 04:19:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:41,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-03 04:19:41,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:19:41,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:19:42,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489533182] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:42,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1870431184] [2021-11-03 04:19:42,198 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:42,198 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:42,198 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:42,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:42,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 34 [2021-11-03 04:19:42,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977481998] [2021-11-03 04:19:42,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-03 04:19:42,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-03 04:19:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-11-03 04:19:42,201 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 34 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2021-11-03 04:19:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:42,708 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2021-11-03 04:19:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 04:19:42,711 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 36 [2021-11-03 04:19:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:42,712 INFO L225 Difference]: With dead ends: 120 [2021-11-03 04:19:42,712 INFO L226 Difference]: Without dead ends: 116 [2021-11-03 04:19:42,714 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2021-11-03 04:19:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-03 04:19:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 77. [2021-11-03 04:19:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 4 states have call predecessors, (11), 13 states have return successors, (31), 18 states have call predecessors, (31), 11 states have call successors, (31) [2021-11-03 04:19:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2021-11-03 04:19:42,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 36 [2021-11-03 04:19:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:42,727 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2021-11-03 04:19:42,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2021-11-03 04:19:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2021-11-03 04:19:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 04:19:42,728 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:42,728 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:42,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:42,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-03 04:19:42,951 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 109703257, now seen corresponding path program 2 times [2021-11-03 04:19:42,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:42,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795764218] [2021-11-03 04:19:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:42,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 04:19:43,073 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:43,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795764218] [2021-11-03 04:19:43,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795764218] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:43,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078772745] [2021-11-03 04:19:43,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:19:43,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:43,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:43,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 04:19:43,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-03 04:19:43,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:19:43,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-03 04:19:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-03 04:19:43,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-03 04:19:44,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078772745] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:44,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360396421] [2021-11-03 04:19:44,621 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:44,621 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:44,622 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:44,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:44,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 33 [2021-11-03 04:19:44,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529758836] [2021-11-03 04:19:44,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-03 04:19:44,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-03 04:19:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2021-11-03 04:19:44,627 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 33 states, 30 states have (on average 2.066666666666667) internal successors, (62), 24 states have internal predecessors, (62), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-11-03 04:19:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:45,119 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2021-11-03 04:19:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 04:19:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.066666666666667) internal successors, (62), 24 states have internal predecessors, (62), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 36 [2021-11-03 04:19:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:45,124 INFO L225 Difference]: With dead ends: 117 [2021-11-03 04:19:45,125 INFO L226 Difference]: Without dead ends: 113 [2021-11-03 04:19:45,126 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2021-11-03 04:19:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-03 04:19:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2021-11-03 04:19:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 58 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 15 states have return successors, (37), 23 states have call predecessors, (37), 11 states have call successors, (37) [2021-11-03 04:19:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2021-11-03 04:19:45,140 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 36 [2021-11-03 04:19:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:45,141 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 113 transitions. [2021-11-03 04:19:45,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.066666666666667) internal successors, (62), 24 states have internal predecessors, (62), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-11-03 04:19:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2021-11-03 04:19:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-03 04:19:45,142 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:45,142 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:45,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:45,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:45,365 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -108106833, now seen corresponding path program 2 times [2021-11-03 04:19:45,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:45,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280137126] [2021-11-03 04:19:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:45,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:19:45,687 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:45,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280137126] [2021-11-03 04:19:45,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280137126] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:45,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29734002] [2021-11-03 04:19:45,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:19:45,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:45,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:45,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 04:19:45,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-03 04:19:45,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:19:45,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-03 04:19:45,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:19:46,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:19:47,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29734002] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:47,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [300513904] [2021-11-03 04:19:47,444 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:47,444 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:47,444 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:47,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:47,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 35 [2021-11-03 04:19:47,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268701167] [2021-11-03 04:19:47,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-03 04:19:47,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:47,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-03 04:19:47,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2021-11-03 04:19:47,448 INFO L87 Difference]: Start difference. First operand 86 states and 113 transitions. Second operand has 35 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-11-03 04:19:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:48,264 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2021-11-03 04:19:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:19:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Word has length 42 [2021-11-03 04:19:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:48,265 INFO L225 Difference]: With dead ends: 96 [2021-11-03 04:19:48,265 INFO L226 Difference]: Without dead ends: 87 [2021-11-03 04:19:48,266 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1739, Unknown=0, NotChecked=0, Total=1980 [2021-11-03 04:19:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-03 04:19:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2021-11-03 04:19:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 53 states have internal predecessors, (60), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (31), 20 states have call predecessors, (31), 10 states have call successors, (31) [2021-11-03 04:19:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2021-11-03 04:19:48,277 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 42 [2021-11-03 04:19:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:48,277 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2021-11-03 04:19:48,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2021-11-03 04:19:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2021-11-03 04:19:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-03 04:19:48,279 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:48,279 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:48,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:48,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-03 04:19:48,497 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1392489715, now seen corresponding path program 3 times [2021-11-03 04:19:48,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:48,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061273384] [2021-11-03 04:19:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:48,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-03 04:19:48,673 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:48,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061273384] [2021-11-03 04:19:48,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061273384] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:48,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019238153] [2021-11-03 04:19:48,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:19:48,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:48,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:48,674 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:48,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-03 04:19:48,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:19:48,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:19:48,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-03 04:19:48,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-03 04:19:49,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:19:50,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019238153] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:50,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1018594888] [2021-11-03 04:19:50,321 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:50,321 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:50,321 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:50,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:50,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 35 [2021-11-03 04:19:50,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243066545] [2021-11-03 04:19:50,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-03 04:19:50,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:50,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-03 04:19:50,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2021-11-03 04:19:50,325 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 35 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 25 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (14), 11 states have call predecessors, (14), 9 states have call successors, (14) [2021-11-03 04:19:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:50,957 INFO L93 Difference]: Finished difference Result 123 states and 167 transitions. [2021-11-03 04:19:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-03 04:19:50,958 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 25 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (14), 11 states have call predecessors, (14), 9 states have call successors, (14) Word has length 44 [2021-11-03 04:19:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:50,959 INFO L225 Difference]: With dead ends: 123 [2021-11-03 04:19:50,959 INFO L226 Difference]: Without dead ends: 119 [2021-11-03 04:19:50,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2021-11-03 04:19:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-03 04:19:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 55. [2021-11-03 04:19:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2021-11-03 04:19:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2021-11-03 04:19:50,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 44 [2021-11-03 04:19:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:50,969 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-11-03 04:19:50,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 25 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (14), 11 states have call predecessors, (14), 9 states have call successors, (14) [2021-11-03 04:19:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-11-03 04:19:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-03 04:19:50,970 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:50,970 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:50,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-03 04:19:51,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-03 04:19:51,175 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1481032095, now seen corresponding path program 3 times [2021-11-03 04:19:51,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:51,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691051225] [2021-11-03 04:19:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:51,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-03 04:19:51,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:51,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691051225] [2021-11-03 04:19:51,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691051225] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:51,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091634338] [2021-11-03 04:19:51,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:19:51,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:51,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:51,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-03 04:19:51,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:19:51,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:19:51,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-03 04:19:51,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:19:51,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:19:52,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091634338] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:52,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [346513924] [2021-11-03 04:19:52,777 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:19:52,777 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:52,778 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:52,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:52,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 28 [2021-11-03 04:19:52,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064895399] [2021-11-03 04:19:52,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-03 04:19:52,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-03 04:19:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2021-11-03 04:19:52,782 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 28 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 24 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-03 04:19:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:53,064 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2021-11-03 04:19:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:19:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 24 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 43 [2021-11-03 04:19:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:53,066 INFO L225 Difference]: With dead ends: 85 [2021-11-03 04:19:53,066 INFO L226 Difference]: Without dead ends: 81 [2021-11-03 04:19:53,067 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2021-11-03 04:19:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-03 04:19:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2021-11-03 04:19:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 10 states have call successors, (10), 4 states have call predecessors, (10), 10 states have return successors, (21), 14 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-03 04:19:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2021-11-03 04:19:53,074 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 43 [2021-11-03 04:19:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:53,074 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2021-11-03 04:19:53,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 24 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-03 04:19:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2021-11-03 04:19:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-03 04:19:53,075 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:53,075 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:53,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:53,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-03 04:19:53,288 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash -755567679, now seen corresponding path program 1 times [2021-11-03 04:19:53,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:53,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025906697] [2021-11-03 04:19:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:53,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:19:53,473 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:53,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025906697] [2021-11-03 04:19:53,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025906697] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:53,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525939449] [2021-11-03 04:19:53,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:53,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:53,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:53,475 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:53,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-03 04:19:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:53,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-03 04:19:53,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:19:54,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:19:55,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525939449] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:55,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1331437828] [2021-11-03 04:19:55,279 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:19:55,283 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:55,283 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:55,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:55,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 33 [2021-11-03 04:19:55,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168092861] [2021-11-03 04:19:55,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-03 04:19:55,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-03 04:19:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-11-03 04:19:55,287 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 26 states have internal predecessors, (65), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-03 04:19:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:55,847 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2021-11-03 04:19:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 04:19:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 26 states have internal predecessors, (65), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) Word has length 43 [2021-11-03 04:19:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:55,849 INFO L225 Difference]: With dead ends: 111 [2021-11-03 04:19:55,849 INFO L226 Difference]: Without dead ends: 107 [2021-11-03 04:19:55,850 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1811, Unknown=0, NotChecked=0, Total=2070 [2021-11-03 04:19:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-03 04:19:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2021-11-03 04:19:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.125) internal successors, (54), 49 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (24), 16 states have call predecessors, (24), 10 states have call successors, (24) [2021-11-03 04:19:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2021-11-03 04:19:55,859 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 43 [2021-11-03 04:19:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:55,860 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2021-11-03 04:19:55,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 26 states have internal predecessors, (65), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-03 04:19:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2021-11-03 04:19:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-03 04:19:55,861 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:55,861 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:55,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:56,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-03 04:19:56,075 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 647656449, now seen corresponding path program 2 times [2021-11-03 04:19:56,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:56,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535778480] [2021-11-03 04:19:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:56,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 04:19:56,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:56,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535778480] [2021-11-03 04:19:56,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535778480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:56,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615159691] [2021-11-03 04:19:56,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:19:56,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:56,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:56,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-03 04:19:56,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-03 04:19:56,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:19:56,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-03 04:19:56,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-03 04:19:56,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:19:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 04:19:57,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615159691] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:19:57,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [536517456] [2021-11-03 04:19:57,570 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:19:57,570 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:19:57,570 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:19:57,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:19:57,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 21 [2021-11-03 04:19:57,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818071757] [2021-11-03 04:19:57,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 04:19:57,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:19:57,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 04:19:57,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-11-03 04:19:57,576 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-03 04:19:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:19:57,852 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2021-11-03 04:19:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 04:19:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2021-11-03 04:19:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:19:57,854 INFO L225 Difference]: With dead ends: 98 [2021-11-03 04:19:57,854 INFO L226 Difference]: Without dead ends: 94 [2021-11-03 04:19:57,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 65 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2021-11-03 04:19:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-03 04:19:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2021-11-03 04:19:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (30), 19 states have call predecessors, (30), 10 states have call successors, (30) [2021-11-03 04:19:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2021-11-03 04:19:57,864 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 43 [2021-11-03 04:19:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:19:57,865 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2021-11-03 04:19:57,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-03 04:19:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2021-11-03 04:19:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 04:19:57,866 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:19:57,866 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:19:57,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-03 04:19:58,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-03 04:19:58,067 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:19:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:19:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1586980819, now seen corresponding path program 3 times [2021-11-03 04:19:58,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:19:58,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590850681] [2021-11-03 04:19:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:19:58,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:19:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:19:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:19:58,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:19:58,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590850681] [2021-11-03 04:19:58,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590850681] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:19:58,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854940303] [2021-11-03 04:19:58,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:19:58,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:19:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:19:58,244 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:19:58,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-03 04:19:58,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:19:58,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:19:58,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 04:19:58,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:19:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-03 04:19:59,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-03 04:20:00,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854940303] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:20:00,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1111231072] [2021-11-03 04:20:00,393 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:20:00,393 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:20:00,393 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:20:00,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:20:00,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 19] total 31 [2021-11-03 04:20:00,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696492959] [2021-11-03 04:20:00,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-03 04:20:00,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:20:00,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-03 04:20:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-11-03 04:20:00,396 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 31 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-03 04:20:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:20:00,885 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2021-11-03 04:20:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 04:20:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) Word has length 51 [2021-11-03 04:20:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:20:00,887 INFO L225 Difference]: With dead ends: 128 [2021-11-03 04:20:00,887 INFO L226 Difference]: Without dead ends: 124 [2021-11-03 04:20:00,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 74 SyntacticMatches, 17 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1413, Unknown=0, NotChecked=0, Total=1640 [2021-11-03 04:20:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-03 04:20:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 79. [2021-11-03 04:20:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (30), 21 states have call predecessors, (30), 10 states have call successors, (30) [2021-11-03 04:20:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2021-11-03 04:20:00,903 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 51 [2021-11-03 04:20:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:20:00,904 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2021-11-03 04:20:00,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-03 04:20:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2021-11-03 04:20:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-03 04:20:00,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:20:00,906 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:20:00,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-03 04:20:01,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:01,131 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:20:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:20:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1551997235, now seen corresponding path program 4 times [2021-11-03 04:20:01,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:20:01,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143022] [2021-11-03 04:20:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:20:01,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:20:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-03 04:20:01,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:20:01,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143022] [2021-11-03 04:20:01,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143022] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:20:01,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868242724] [2021-11-03 04:20:01,327 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:20:01,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:01,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:20:01,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:20:01,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-03 04:20:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:01,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-03 04:20:01,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:20:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-03 04:20:02,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:20:03,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868242724] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:20:03,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [703962459] [2021-11-03 04:20:03,691 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:20:03,692 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:20:03,692 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:20:03,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:20:03,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 20] total 36 [2021-11-03 04:20:03,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541204528] [2021-11-03 04:20:03,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-03 04:20:03,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:20:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-03 04:20:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2021-11-03 04:20:03,695 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 36 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 27 states have internal predecessors, (72), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-03 04:20:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:20:04,459 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2021-11-03 04:20:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-03 04:20:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 27 states have internal predecessors, (72), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Word has length 51 [2021-11-03 04:20:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:20:04,461 INFO L225 Difference]: With dead ends: 123 [2021-11-03 04:20:04,461 INFO L226 Difference]: Without dead ends: 119 [2021-11-03 04:20:04,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=2230, Unknown=0, NotChecked=0, Total=2550 [2021-11-03 04:20:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-03 04:20:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 58. [2021-11-03 04:20:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-03 04:20:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2021-11-03 04:20:04,467 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 51 [2021-11-03 04:20:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:20:04,467 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2021-11-03 04:20:04,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 27 states have internal predecessors, (72), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-03 04:20:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2021-11-03 04:20:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 04:20:04,468 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:20:04,468 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:20:04,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-03 04:20:04,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:04,669 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:20:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:20:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1294432549, now seen corresponding path program 4 times [2021-11-03 04:20:04,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:20:04,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742268985] [2021-11-03 04:20:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:20:04,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:20:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:20:04,877 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:20:04,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742268985] [2021-11-03 04:20:04,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742268985] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:20:04,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716617015] [2021-11-03 04:20:04,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:20:04,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:04,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:20:04,879 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:20:04,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-03 04:20:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:05,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-03 04:20:05,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:20:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-03 04:20:05,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:20:07,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716617015] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:20:07,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774479137] [2021-11-03 04:20:07,015 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-03 04:20:07,015 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:20:07,015 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:20:07,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:20:07,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 18] total 29 [2021-11-03 04:20:07,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846994857] [2021-11-03 04:20:07,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-03 04:20:07,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:20:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-03 04:20:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-11-03 04:20:07,019 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-03 04:20:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:20:07,407 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2021-11-03 04:20:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:20:07,408 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) Word has length 50 [2021-11-03 04:20:07,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:20:07,409 INFO L225 Difference]: With dead ends: 88 [2021-11-03 04:20:07,409 INFO L226 Difference]: Without dead ends: 84 [2021-11-03 04:20:07,410 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2021-11-03 04:20:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-03 04:20:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2021-11-03 04:20:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 10 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (22), 15 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-03 04:20:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2021-11-03 04:20:07,416 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 50 [2021-11-03 04:20:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:20:07,416 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2021-11-03 04:20:07,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-03 04:20:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2021-11-03 04:20:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 04:20:07,417 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:20:07,418 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:20:07,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-03 04:20:07,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-03 04:20:07,631 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:20:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:20:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash 36046203, now seen corresponding path program 5 times [2021-11-03 04:20:07,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:20:07,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218766245] [2021-11-03 04:20:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:20:07,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:20:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:20:07,813 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:20:07,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218766245] [2021-11-03 04:20:07,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218766245] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:20:07,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282432322] [2021-11-03 04:20:07,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:20:07,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:20:07,814 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:20:07,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-03 04:20:08,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-03 04:20:08,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:20:08,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-03 04:20:08,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:20:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-03 04:20:08,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-03 04:20:09,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282432322] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:20:09,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1138058809] [2021-11-03 04:20:09,756 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:20:09,756 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:20:09,757 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:20:09,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:20:09,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 18] total 29 [2021-11-03 04:20:09,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986388174] [2021-11-03 04:20:09,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-03 04:20:09,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:20:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-03 04:20:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-11-03 04:20:09,760 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-03 04:20:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:20:10,154 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2021-11-03 04:20:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:20:10,159 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) Word has length 50 [2021-11-03 04:20:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:20:10,160 INFO L225 Difference]: With dead ends: 96 [2021-11-03 04:20:10,161 INFO L226 Difference]: Without dead ends: 92 [2021-11-03 04:20:10,161 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2021-11-03 04:20:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-03 04:20:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2021-11-03 04:20:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (24), 16 states have call predecessors, (24), 10 states have call successors, (24) [2021-11-03 04:20:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2021-11-03 04:20:10,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 50 [2021-11-03 04:20:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:20:10,170 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2021-11-03 04:20:10,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-03 04:20:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2021-11-03 04:20:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-03 04:20:10,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:20:10,171 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:20:10,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-03 04:20:10,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-03 04:20:10,383 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:20:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:20:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1876802875, now seen corresponding path program 6 times [2021-11-03 04:20:10,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:20:10,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102060051] [2021-11-03 04:20:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:20:10,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:20:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-03 04:20:10,647 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:20:10,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102060051] [2021-11-03 04:20:10,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102060051] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:20:10,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292450376] [2021-11-03 04:20:10,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 04:20:10,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:20:10,656 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:20:10,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-03 04:20:11,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 04:20:11,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:20:11,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 04:20:11,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:20:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-03 04:20:11,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-03 04:20:12,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292450376] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:20:12,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1499457933] [2021-11-03 04:20:12,612 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:20:12,612 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:20:12,612 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:20:12,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:20:12,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 37 [2021-11-03 04:20:12,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450181083] [2021-11-03 04:20:12,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-03 04:20:12,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:20:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-03 04:20:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1226, Unknown=0, NotChecked=0, Total=1332 [2021-11-03 04:20:12,616 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 37 states, 33 states have (on average 2.272727272727273) internal successors, (75), 31 states have internal predecessors, (75), 12 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-03 04:20:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:20:13,284 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2021-11-03 04:20:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 04:20:13,285 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.272727272727273) internal successors, (75), 31 states have internal predecessors, (75), 12 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Word has length 50 [2021-11-03 04:20:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:20:13,286 INFO L225 Difference]: With dead ends: 90 [2021-11-03 04:20:13,286 INFO L226 Difference]: Without dead ends: 81 [2021-11-03 04:20:13,287 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=1999, Unknown=0, NotChecked=0, Total=2256 [2021-11-03 04:20:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-03 04:20:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2021-11-03 04:20:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (24), 17 states have call predecessors, (24), 10 states have call successors, (24) [2021-11-03 04:20:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2021-11-03 04:20:13,294 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 50 [2021-11-03 04:20:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:20:13,294 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2021-11-03 04:20:13,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.272727272727273) internal successors, (75), 31 states have internal predecessors, (75), 12 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-03 04:20:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2021-11-03 04:20:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-03 04:20:13,295 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:20:13,296 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:20:13,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-03 04:20:13,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:13,510 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:20:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:20:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1448267663, now seen corresponding path program 7 times [2021-11-03 04:20:13,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:20:13,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736847373] [2021-11-03 04:20:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:20:13,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:20:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:20:13,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:20:13,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736847373] [2021-11-03 04:20:13,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736847373] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:20:13,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770112994] [2021-11-03 04:20:13,728 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 04:20:13,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:13,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:20:13,729 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:20:13,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-03 04:20:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:14,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-03 04:20:14,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:20:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-03 04:20:14,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-03 04:20:16,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770112994] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 04:20:16,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845968662] [2021-11-03 04:20:16,276 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-03 04:20:16,276 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:20:16,277 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 04:20:16,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 04:20:16,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 19] total 30 [2021-11-03 04:20:16,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415502476] [2021-11-03 04:20:16,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-03 04:20:16,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:20:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-03 04:20:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2021-11-03 04:20:16,281 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 25 states have internal predecessors, (73), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-03 04:20:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:20:16,778 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2021-11-03 04:20:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 04:20:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 25 states have internal predecessors, (73), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) Word has length 58 [2021-11-03 04:20:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:20:16,780 INFO L225 Difference]: With dead ends: 103 [2021-11-03 04:20:16,780 INFO L226 Difference]: Without dead ends: 99 [2021-11-03 04:20:16,780 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2021-11-03 04:20:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-03 04:20:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2021-11-03 04:20:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 14 states have return successors, (30), 20 states have call predecessors, (30), 10 states have call successors, (30) [2021-11-03 04:20:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2021-11-03 04:20:16,787 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 58 [2021-11-03 04:20:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:20:16,787 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2021-11-03 04:20:16,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 25 states have internal predecessors, (73), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-03 04:20:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2021-11-03 04:20:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-03 04:20:16,789 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:20:16,789 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:20:16,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-03 04:20:16,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-03 04:20:16,999 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:20:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:20:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -189962193, now seen corresponding path program 5 times [2021-11-03 04:20:17,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:20:17,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065768224] [2021-11-03 04:20:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:20:17,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:20:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:20:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:20:17,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:20:17,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065768224] [2021-11-03 04:20:17,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065768224] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:20:17,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492731907] [2021-11-03 04:20:17,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 04:20:17,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:20:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:20:17,250 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:20:17,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e7d348a-aeb4-4beb-8112-a20c8212282a/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-03 04:20:18,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-03 04:20:18,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 04:20:18,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-03 04:20:18,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:20:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-03 04:20:18,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:20:20,152 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.