./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/tree_max.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9 --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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 21:04:54,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:04:54,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:04:54,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:04:54,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:04:54,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:04:54,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:04:54,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:04:54,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:04:54,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:04:54,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:04:54,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:04:54,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:04:54,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:04:54,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:04:54,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:04:54,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:04:54,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:04:54,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:04:54,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:04:54,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:04:54,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:04:54,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:04:54,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:04:54,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:04:54,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:04:54,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:04:54,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:04:54,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:04:54,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:04:54,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:04:54,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:04:54,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:04:54,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:04:54,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:04:54,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:04:54,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:04:54,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:04:54,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:04:54,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:04:54,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:04:54,922 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 21:04:54,971 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:04:54,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:04:54,972 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:04:54,972 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:04:54,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:04:54,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:04:54,974 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:04:54,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:04:54,975 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:04:54,975 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:04:54,976 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:04:54,977 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:04:54,977 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:04:54,977 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:04:54,978 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:04:54,978 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:04:54,978 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:04:54,979 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:04:54,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:04:54,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:04:54,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:04:54,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:04:54,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:04:54,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 21:04:54,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:04:54,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 21:04:54,983 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:04:54,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 21:04:54,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:04:54,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 21:04:54,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:04:54,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:04:54,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:04:54,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:04:54,986 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:04:54,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:04:54,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 21:04:54,986 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:04:54,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:04:54,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 21:04:54,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:04:54,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/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_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2022-11-20 21:04:55,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:04:55,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:04:55,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:04:55,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:04:55,358 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:04:55,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/verifythis/tree_max.c [2022-11-20 21:04:58,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:04:58,839 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:04:58,840 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/sv-benchmarks/c/verifythis/tree_max.c [2022-11-20 21:04:58,849 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/data/111815b35/37067669c35f4601a7e8b597d2dceb98/FLAG7206c78fa [2022-11-20 21:04:58,877 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/data/111815b35/37067669c35f4601a7e8b597d2dceb98 [2022-11-20 21:04:58,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:04:58,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:04:58,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:04:58,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:04:58,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:04:58,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:04:58" (1/1) ... [2022-11-20 21:04:58,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c80a018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:58, skipping insertion in model container [2022-11-20 21:04:58,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:04:58" (1/1) ... [2022-11-20 21:04:58,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:04:58,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:04:59,146 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-11-20 21:04:59,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:04:59,194 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:04:59,213 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-11-20 21:04:59,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:04:59,256 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:04:59,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59 WrapperNode [2022-11-20 21:04:59,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:04:59,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:04:59,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:04:59,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:04:59,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,314 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2022-11-20 21:04:59,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:04:59,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:04:59,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:04:59,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:04:59,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:04:59,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:04:59,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:04:59,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:04:59,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (1/1) ... [2022-11-20 21:04:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:04:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:04:59,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:04:59,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:04:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 21:04:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:04:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-11-20 21:04:59,465 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-11-20 21:04:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-20 21:04:59,466 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-20 21:04:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:04:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-11-20 21:04:59,467 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-11-20 21:04:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 21:04:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 21:04:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 21:04:59,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:04:59,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:04:59,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 21:04:59,584 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:04:59,587 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:04:59,792 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:04:59,844 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:04:59,844 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 21:04:59,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:04:59 BoogieIcfgContainer [2022-11-20 21:04:59,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:04:59,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:04:59,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:04:59,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:04:59,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:04:58" (1/3) ... [2022-11-20 21:04:59,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55740287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:04:59, skipping insertion in model container [2022-11-20 21:04:59,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:04:59" (2/3) ... [2022-11-20 21:04:59,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55740287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:04:59, skipping insertion in model container [2022-11-20 21:04:59,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:04:59" (3/3) ... [2022-11-20 21:04:59,887 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2022-11-20 21:04:59,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:04:59,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 21:04:59,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:04:59,988 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a0ad719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:04:59,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 21:04:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 21:05:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 21:05:00,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:00,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:00,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash 473264591, now seen corresponding path program 1 times [2022-11-20 21:05:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:00,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537432943] [2022-11-20 21:05:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:05:00,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:00,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537432943] [2022-11-20 21:05:00,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537432943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:00,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:00,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 21:05:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049712476] [2022-11-20 21:05:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:00,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:05:00,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:05:00,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:05:00,825 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 21:05:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:01,029 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-11-20 21:05:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 21:05:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-20 21:05:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:01,045 INFO L225 Difference]: With dead ends: 65 [2022-11-20 21:05:01,045 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 21:05:01,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:05:01,053 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:01,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 219 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:05:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 21:05:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 21:05:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 21:05:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-11-20 21:05:01,106 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2022-11-20 21:05:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:01,107 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-11-20 21:05:01,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 21:05:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-11-20 21:05:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 21:05:01,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:01,115 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:01,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 21:05:01,116 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1325382702, now seen corresponding path program 1 times [2022-11-20 21:05:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:01,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411680539] [2022-11-20 21:05:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 21:05:01,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:01,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411680539] [2022-11-20 21:05:01,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411680539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:05:01,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:05:01,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 21:05:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077396167] [2022-11-20 21:05:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:05:01,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 21:05:01,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:01,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 21:05:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 21:05:01,391 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 21:05:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:01,523 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-20 21:05:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 21:05:01,525 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), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-11-20 21:05:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:01,527 INFO L225 Difference]: With dead ends: 45 [2022-11-20 21:05:01,527 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 21:05:01,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 21:05:01,530 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:01,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:05:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 21:05:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-20 21:05:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 24 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-20 21:05:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-20 21:05:01,541 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-11-20 21:05:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:01,542 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-20 21:05:01,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 21:05:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-11-20 21:05:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 21:05:01,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:01,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-20 21:05:01,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 21:05:01,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash 484307838, now seen corresponding path program 1 times [2022-11-20 21:05:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:01,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079686629] [2022-11-20 21:05:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 21:05:02,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:02,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079686629] [2022-11-20 21:05:02,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079686629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:02,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774779600] [2022-11-20 21:05:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:02,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:02,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:02,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 21:05:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:02,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-20 21:05:02,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:03,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:03,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:05:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 21:05:03,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 21:05:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774779600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [102193271] [2022-11-20 21:05:04,879 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-20 21:05:04,879 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:04,883 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:05:04,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:04,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 11] total 31 [2022-11-20 21:05:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615734882] [2022-11-20 21:05:04,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:04,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 21:05:04,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:04,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 21:05:04,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2022-11-20 21:05:04,896 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-11-20 21:05:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:05,966 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-11-20 21:05:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 21:05:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 39 [2022-11-20 21:05:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:05,969 INFO L225 Difference]: With dead ends: 49 [2022-11-20 21:05:05,969 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 21:05:05,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 21:05:05,972 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 82 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:05,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 208 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 21:05:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 21:05:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-11-20 21:05:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-20 21:05:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-11-20 21:05:05,984 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 39 [2022-11-20 21:05:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:05,985 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-11-20 21:05:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-11-20 21:05:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-11-20 21:05:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 21:05:05,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:05,987 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-11-20 21:05:06,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:06,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:06,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash -518813507, now seen corresponding path program 1 times [2022-11-20 21:05:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:06,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082605114] [2022-11-20 21:05:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:06,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 21:05:07,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:07,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082605114] [2022-11-20 21:05:07,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082605114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224337304] [2022-11-20 21:05:07,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:07,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:07,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:07,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:07,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 21:05:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:07,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 21:05:07,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:07,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:05:07,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:05:07,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:05:07,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:05:07,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:05:07,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:05:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 21:05:07,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 21:05:08,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224337304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:08,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072937875] [2022-11-20 21:05:08,415 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:05:08,415 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:08,416 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:05:08,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:08,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 33 [2022-11-20 21:05:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869788231] [2022-11-20 21:05:08,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:08,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:05:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:05:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 21:05:08,424 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 33 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-20 21:05:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:09,535 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-11-20 21:05:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 21:05:09,536 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) Word has length 45 [2022-11-20 21:05:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:09,539 INFO L225 Difference]: With dead ends: 90 [2022-11-20 21:05:09,539 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 21:05:09,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=181, Invalid=2075, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 21:05:09,541 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:09,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 532 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 736 Invalid, 0 Unknown, 168 Unchecked, 0.6s Time] [2022-11-20 21:05:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 21:05:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-11-20 21:05:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (27), 14 states have call predecessors, (27), 11 states have call successors, (27) [2022-11-20 21:05:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-11-20 21:05:09,557 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 45 [2022-11-20 21:05:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:09,558 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-11-20 21:05:09,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-20 21:05:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-11-20 21:05:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 21:05:09,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:09,561 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-11-20 21:05:09,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:09,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:09,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -402449861, now seen corresponding path program 1 times [2022-11-20 21:05:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:09,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549276080] [2022-11-20 21:05:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 21:05:10,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:10,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549276080] [2022-11-20 21:05:10,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549276080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347948197] [2022-11-20 21:05:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:10,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:10,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 21:05:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:10,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 21:05:10,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:10,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:10,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:10,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:05:10,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:05:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 21:05:10,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 21:05:11,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347948197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:11,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [279427840] [2022-11-20 21:05:11,141 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:05:11,141 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:11,142 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:05:11,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:11,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 20 [2022-11-20 21:05:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298790683] [2022-11-20 21:05:11,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:11,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 21:05:11,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:11,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 21:05:11,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-11-20 21:05:11,148 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 21:05:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:11,500 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. [2022-11-20 21:05:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:05:11,502 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-11-20 21:05:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:11,506 INFO L225 Difference]: With dead ends: 116 [2022-11-20 21:05:11,506 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 21:05:11,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2022-11-20 21:05:11,508 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:11,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 416 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-11-20 21:05:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 21:05:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-11-20 21:05:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 17 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (35), 18 states have call predecessors, (35), 12 states have call successors, (35) [2022-11-20 21:05:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-11-20 21:05:11,526 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 45 [2022-11-20 21:05:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:11,527 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-11-20 21:05:11,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 21:05:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-11-20 21:05:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 21:05:11,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:11,530 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2022-11-20 21:05:11,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:11,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:11,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:11,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash -310864104, now seen corresponding path program 2 times [2022-11-20 21:05:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:11,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483508987] [2022-11-20 21:05:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-20 21:05:12,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:12,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483508987] [2022-11-20 21:05:12,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483508987] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:12,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545662444] [2022-11-20 21:05:12,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:05:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:12,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:12,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 21:05:12,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:05:12,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:12,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-20 21:05:12,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:12,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:12,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:13,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 21:05:13,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 21:05:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-20 21:05:13,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:21,398 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:05:27,506 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:05:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 21:05:27,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545662444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:27,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [162371305] [2022-11-20 21:05:27,665 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:05:27,665 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:27,665 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:05:27,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:27,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 26 [2022-11-20 21:05:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638909109] [2022-11-20 21:05:27,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:27,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:05:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:05:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=585, Unknown=1, NotChecked=0, Total=650 [2022-11-20 21:05:27,669 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 12 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-20 21:05:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:28,216 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2022-11-20 21:05:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 21:05:28,217 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 12 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) Word has length 55 [2022-11-20 21:05:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:28,218 INFO L225 Difference]: With dead ends: 130 [2022-11-20 21:05:28,218 INFO L226 Difference]: Without dead ends: 111 [2022-11-20 21:05:28,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=136, Invalid=1123, Unknown=1, NotChecked=0, Total=1260 [2022-11-20 21:05:28,220 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:28,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 351 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 414 Invalid, 0 Unknown, 29 Unchecked, 0.3s Time] [2022-11-20 21:05:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-20 21:05:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-11-20 21:05:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 17 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (42), 20 states have call predecessors, (42), 12 states have call successors, (42) [2022-11-20 21:05:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2022-11-20 21:05:28,237 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 55 [2022-11-20 21:05:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:28,238 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2022-11-20 21:05:28,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 12 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-20 21:05:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-11-20 21:05:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 21:05:28,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:28,241 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:28,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:28,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:28,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1830536044, now seen corresponding path program 3 times [2022-11-20 21:05:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:28,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24204753] [2022-11-20 21:05:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-20 21:05:30,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:30,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24204753] [2022-11-20 21:05:30,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24204753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:30,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105261211] [2022-11-20 21:05:30,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:05:30,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:30,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:30,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 21:05:30,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:05:30,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:30,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 21:05:30,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:30,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:30,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:31,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 21:05:31,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 21:05:31,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:05:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-20 21:05:31,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:33,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 15 [2022-11-20 21:05:33,943 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-20 21:05:33,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 39 [2022-11-20 21:05:34,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105261211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:34,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [269215210] [2022-11-20 21:05:34,609 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:05:34,609 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:34,610 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:05:34,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:05:34,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 44 [2022-11-20 21:05:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987745651] [2022-11-20 21:05:34,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:34,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 21:05:34,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:34,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 21:05:34,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2592, Unknown=0, NotChecked=0, Total=2756 [2022-11-20 21:05:34,616 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 15 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-20 21:05:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:36,089 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2022-11-20 21:05:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 21:05:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 15 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 67 [2022-11-20 21:05:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:36,092 INFO L225 Difference]: With dead ends: 103 [2022-11-20 21:05:36,093 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 21:05:36,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=323, Invalid=4369, Unknown=0, NotChecked=0, Total=4692 [2022-11-20 21:05:36,113 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:36,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 679 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 21:05:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 21:05:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-11-20 21:05:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 62 states have internal predecessors, (65), 18 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (42), 20 states have call predecessors, (42), 12 states have call successors, (42) [2022-11-20 21:05:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2022-11-20 21:05:36,137 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 67 [2022-11-20 21:05:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:36,138 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2022-11-20 21:05:36,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 15 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-20 21:05:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2022-11-20 21:05:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 21:05:36,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:36,141 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:05:36,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:36,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:36,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash 890264430, now seen corresponding path program 2 times [2022-11-20 21:05:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:36,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059990075] [2022-11-20 21:05:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 21:05:37,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059990075] [2022-11-20 21:05:37,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059990075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481377123] [2022-11-20 21:05:37,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:05:37,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:37,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:37,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:37,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 21:05:38,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:05:38,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:05:38,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 21:05:38,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:38,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-20 21:05:40,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:05:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-20 21:05:41,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481377123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:05:41,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1606545752] [2022-11-20 21:05:41,317 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:05:41,317 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:05:41,319 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:05:41,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:05:41,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 13] total 43 [2022-11-20 21:05:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161287331] [2022-11-20 21:05:41,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:05:41,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 21:05:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:05:41,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 21:05:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1678, Unknown=1, NotChecked=0, Total=1806 [2022-11-20 21:05:41,325 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 43 states, 35 states have (on average 2.142857142857143) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (28), 6 states have call predecessors, (28), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-11-20 21:05:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:05:52,504 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2022-11-20 21:05:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 21:05:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 2.142857142857143) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (28), 6 states have call predecessors, (28), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) Word has length 67 [2022-11-20 21:05:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:05:52,506 INFO L225 Difference]: With dead ends: 123 [2022-11-20 21:05:52,506 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 21:05:52,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=562, Invalid=6075, Unknown=5, NotChecked=0, Total=6642 [2022-11-20 21:05:52,510 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:05:52,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 433 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1444 Invalid, 0 Unknown, 471 Unchecked, 1.3s Time] [2022-11-20 21:05:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 21:05:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2022-11-20 21:05:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 19 states have call successors, (19), 8 states have call predecessors, (19), 13 states have return successors, (43), 21 states have call predecessors, (43), 13 states have call successors, (43) [2022-11-20 21:05:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2022-11-20 21:05:52,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 67 [2022-11-20 21:05:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:05:52,529 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2022-11-20 21:05:52,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 2.142857142857143) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (28), 6 states have call predecessors, (28), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-11-20 21:05:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2022-11-20 21:05:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 21:05:52,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:05:52,532 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 4, 3, 3, 3, 3, 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] [2022-11-20 21:05:52,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 21:05:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 21:05:52,741 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:05:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:05:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1173007470, now seen corresponding path program 1 times [2022-11-20 21:05:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:05:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078446184] [2022-11-20 21:05:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:05:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-20 21:05:54,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:05:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078446184] [2022-11-20 21:05:54,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078446184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:05:54,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747894807] [2022-11-20 21:05:54,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:05:54,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:05:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:05:54,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:05:54,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 21:05:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:05:54,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-20 21:05:54,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:05:54,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:05:55,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:55,149 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:05:55,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:05:55,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:05:55,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-20 21:05:56,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:05:56,216 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 21:05:56,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 22 [2022-11-20 21:05:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 35 proven. 51 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 21:05:56,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:05,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747894807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:05,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624435630] [2022-11-20 21:06:05,161 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-20 21:06:05,161 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:06:05,162 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:06:05,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:06:05,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2022-11-20 21:06:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079285790] [2022-11-20 21:06:05,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 21:06:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:05,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 21:06:05,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2214, Unknown=0, NotChecked=0, Total=2352 [2022-11-20 21:06:05,165 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 44 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 18 states have call successors, (24), 7 states have call predecessors, (24), 14 states have return successors, (20), 18 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-20 21:06:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:09,148 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2022-11-20 21:06:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-20 21:06:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 18 states have call successors, (24), 7 states have call predecessors, (24), 14 states have return successors, (20), 18 states have call predecessors, (20), 14 states have call successors, (20) Word has length 83 [2022-11-20 21:06:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:09,155 INFO L225 Difference]: With dead ends: 236 [2022-11-20 21:06:09,156 INFO L226 Difference]: Without dead ends: 211 [2022-11-20 21:06:09,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2918 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=624, Invalid=10296, Unknown=0, NotChecked=0, Total=10920 [2022-11-20 21:06:09,160 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:09,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 525 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2240 Invalid, 0 Unknown, 831 Unchecked, 1.6s Time] [2022-11-20 21:06:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-20 21:06:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2022-11-20 21:06:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 114 states have (on average 1.087719298245614) internal successors, (124), 117 states have internal predecessors, (124), 29 states have call successors, (29), 14 states have call predecessors, (29), 27 states have return successors, (106), 39 states have call predecessors, (106), 19 states have call successors, (106) [2022-11-20 21:06:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2022-11-20 21:06:09,194 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 83 [2022-11-20 21:06:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:09,194 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2022-11-20 21:06:09,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 18 states have call successors, (24), 7 states have call predecessors, (24), 14 states have return successors, (20), 18 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-20 21:06:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2022-11-20 21:06:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 21:06:09,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:09,197 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:09,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:09,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:09,404 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:06:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1368080471, now seen corresponding path program 4 times [2022-11-20 21:06:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:09,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530503361] [2022-11-20 21:06:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-20 21:06:11,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:11,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530503361] [2022-11-20 21:06:11,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530503361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:11,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192490994] [2022-11-20 21:06:11,150 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:06:11,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:11,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:11,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:11,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 21:06:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:11,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-20 21:06:11,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:11,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:06:11,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:06:11,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:06:11,430 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:06:11,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:06:11,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:06:11,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:06:12,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:12,784 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-20 21:06:12,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-11-20 21:06:12,795 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 21:06:12,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 21:06:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 39 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-20 21:06:12,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:21,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:06:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-20 21:06:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192490994] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:06:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88319605] [2022-11-20 21:06:21,427 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:06:21,427 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:06:21,428 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:06:21,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:06:21,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 20] total 48 [2022-11-20 21:06:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366839687] [2022-11-20 21:06:21,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-20 21:06:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-20 21:06:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2117, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 21:06:21,437 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand has 48 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 34 states have internal predecessors, (88), 18 states have call successors, (28), 11 states have call predecessors, (28), 10 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) [2022-11-20 21:06:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:22,593 INFO L93 Difference]: Finished difference Result 294 states and 424 transitions. [2022-11-20 21:06:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 21:06:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 34 states have internal predecessors, (88), 18 states have call successors, (28), 11 states have call predecessors, (28), 10 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) Word has length 73 [2022-11-20 21:06:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:22,597 INFO L225 Difference]: With dead ends: 294 [2022-11-20 21:06:22,597 INFO L226 Difference]: Without dead ends: 267 [2022-11-20 21:06:22,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=229, Invalid=3311, Unknown=0, NotChecked=0, Total=3540 [2022-11-20 21:06:22,600 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:22,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 885 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 829 Invalid, 0 Unknown, 272 Unchecked, 0.6s Time] [2022-11-20 21:06:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-20 21:06:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2022-11-20 21:06:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 167 states have (on average 1.089820359281437) internal successors, (182), 169 states have internal predecessors, (182), 42 states have call successors, (42), 22 states have call predecessors, (42), 38 states have return successors, (136), 56 states have call predecessors, (136), 26 states have call successors, (136) [2022-11-20 21:06:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 360 transitions. [2022-11-20 21:06:22,643 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 360 transitions. Word has length 73 [2022-11-20 21:06:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:22,644 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 360 transitions. [2022-11-20 21:06:22,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 34 states have internal predecessors, (88), 18 states have call successors, (28), 11 states have call predecessors, (28), 10 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) [2022-11-20 21:06:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 360 transitions. [2022-11-20 21:06:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 21:06:22,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:22,648 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:22,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 21:06:22,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:22,857 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:06:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash -553581537, now seen corresponding path program 3 times [2022-11-20 21:06:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:22,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371518663] [2022-11-20 21:06:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:06:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 26 proven. 84 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 21:06:29,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:06:29,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371518663] [2022-11-20 21:06:29,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371518663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:29,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984492364] [2022-11-20 21:06:29,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:06:29,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:29,014 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:06:29,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 21:06:29,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:06:29,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:06:29,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 21:06:29,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:06:30,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 21:06:30,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 21:06:30,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:06:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 21:06:30,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:06:32,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-11-20 21:06:32,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2022-11-20 21:06:33,099 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-20 21:06:33,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 34 [2022-11-20 21:06:34,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984492364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:06:34,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1403874642] [2022-11-20 21:06:34,192 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:06:34,192 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:06:34,193 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:06:34,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:06:34,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-11-20 21:06:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217967535] [2022-11-20 21:06:34,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:06:34,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-20 21:06:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:06:34,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-20 21:06:34,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3485, Unknown=0, NotChecked=0, Total=3660 [2022-11-20 21:06:34,198 INFO L87 Difference]: Start difference. First operand 248 states and 360 transitions. Second operand has 48 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 20 states have call successors, (27), 7 states have call predecessors, (27), 12 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-20 21:06:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:06:45,244 INFO L93 Difference]: Finished difference Result 363 states and 533 transitions. [2022-11-20 21:06:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 21:06:45,244 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 20 states have call successors, (27), 7 states have call predecessors, (27), 12 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) Word has length 89 [2022-11-20 21:06:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:06:45,248 INFO L225 Difference]: With dead ends: 363 [2022-11-20 21:06:45,248 INFO L226 Difference]: Without dead ends: 312 [2022-11-20 21:06:45,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=609, Invalid=8511, Unknown=0, NotChecked=0, Total=9120 [2022-11-20 21:06:45,251 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 187 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:06:45,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 309 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-20 21:06:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-20 21:06:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 272. [2022-11-20 21:06:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 185 states have (on average 1.0864864864864865) internal successors, (201), 186 states have internal predecessors, (201), 45 states have call successors, (45), 24 states have call predecessors, (45), 41 states have return successors, (156), 61 states have call predecessors, (156), 28 states have call successors, (156) [2022-11-20 21:06:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 402 transitions. [2022-11-20 21:06:45,295 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 402 transitions. Word has length 89 [2022-11-20 21:06:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:06:45,295 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 402 transitions. [2022-11-20 21:06:45,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 20 states have call successors, (27), 7 states have call predecessors, (27), 12 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-20 21:06:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 402 transitions. [2022-11-20 21:06:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-20 21:06:45,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:45,299 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:06:45,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 21:06:45,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:06:45,505 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:06:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1580534068, now seen corresponding path program 5 times [2022-11-20 21:06:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:45,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770548464] [2022-11-20 21:06:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-20 21:07:32,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770548464] [2022-11-20 21:07:32,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770548464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:07:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121024442] [2022-11-20 21:07:32,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:07:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:32,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:07:32,359 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:07:32,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 21:07:33,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-20 21:07:33,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:07:33,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-20 21:07:33,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:07:33,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:07:33,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:07:33,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:07:34,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-20 21:07:34,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-20 21:07:34,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2022-11-20 21:07:34,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2022-11-20 21:07:34,314 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_arrayElimArr_3)) (= (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_arrayElimArr_4) |c_#memory_$Pointer$.offset|) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) is different from true [2022-11-20 21:07:34,511 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base Int)) (and (= (select |c_old(#valid)| nondet_tree_~n~0.base) 0) (exists ((v_ArrVal_963 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_nondet_tree_~n~0.base_45 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_962 (Array Int Int))) (and (= (select v_arrayElimArr_4 4) 0) (= (store (store (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_DerPreprocessor_3) v_nondet_tree_~n~0.base_45 v_arrayElimArr_3) nondet_tree_~n~0.base v_ArrVal_963) |c_#memory_$Pointer$.base|) (= (select v_arrayElimArr_3 4) 0) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_DerPreprocessor_4) v_nondet_tree_~n~0.base_45 v_arrayElimArr_4) nondet_tree_~n~0.base v_ArrVal_962)))))) is different from true [2022-11-20 21:07:35,657 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base Int)) (and (= (select |c_old(#valid)| nondet_tree_~n~0.base) 0) (exists ((v_nondet_tree_~n~0.base_45 Int) (v_arrayElimArr_4 (Array Int Int)) (v_nondet_tree_~n~0.base_46 Int) (v_arrayElimArr_3 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_966 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= (store (store (store (store (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_DerPreprocessor_5) v_nondet_tree_~n~0.base_46 v_DerPreprocessor_4) v_nondet_tree_~n~0.base_45 v_arrayElimArr_4) v_nondet_tree_~n~0.base_46 v_ArrVal_962) nondet_tree_~n~0.base v_ArrVal_967) |c_#memory_$Pointer$.offset|) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_DerPreprocessor_6) v_nondet_tree_~n~0.base_46) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0) (= (store (store (store (store (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_DerPreprocessor_7) v_nondet_tree_~n~0.base_46 v_DerPreprocessor_3) v_nondet_tree_~n~0.base_45 v_arrayElimArr_3) v_nondet_tree_~n~0.base_46 v_ArrVal_963) nondet_tree_~n~0.base v_ArrVal_966) |c_#memory_$Pointer$.base|))))) is different from true [2022-11-20 21:07:35,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:35,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:35,772 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-20 21:07:35,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 43 [2022-11-20 21:07:35,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:35,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:07:35,832 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-20 21:07:35,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 43 [2022-11-20 21:07:35,871 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-20 21:07:35,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-20 21:07:35,932 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 21:07:35,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 21:07:35,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:07:35,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:08:05,099 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:08:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 82 proven. 105 refuted. 0 times theorem prover too weak. 74 trivial. 42 not checked. [2022-11-20 21:08:05,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:08:07,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121024442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:08:07,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201114631] [2022-11-20 21:08:07,921 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:08:07,921 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:08:07,922 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:08:07,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:08:07,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 42 [2022-11-20 21:08:07,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720576953] [2022-11-20 21:08:07,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:08:07,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 21:08:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:08:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 21:08:07,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1633, Unknown=30, NotChecked=252, Total=2070 [2022-11-20 21:08:07,926 INFO L87 Difference]: Start difference. First operand 272 states and 402 transitions. Second operand has 42 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (27), 7 states have call predecessors, (27), 18 states have return successors, (29), 21 states have call predecessors, (29), 18 states have call successors, (29) [2022-11-20 21:08:26,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 21:08:56,976 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:09:11,176 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 61 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:09:46,468 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 41 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:09:58,609 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:10:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:10:00,850 INFO L93 Difference]: Finished difference Result 549 states and 912 transitions. [2022-11-20 21:10:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-20 21:10:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (27), 7 states have call predecessors, (27), 18 states have return successors, (29), 21 states have call predecessors, (29), 18 states have call successors, (29) Word has length 111 [2022-11-20 21:10:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:10:00,859 INFO L225 Difference]: With dead ends: 549 [2022-11-20 21:10:00,860 INFO L226 Difference]: Without dead ends: 489 [2022-11-20 21:10:00,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 149.6s TimeCoverageRelationStatistics Valid=543, Invalid=5530, Unknown=101, NotChecked=468, Total=6642 [2022-11-20 21:10:00,863 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 609 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:10:00,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 281 Invalid, 1094 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [22 Valid, 463 Invalid, 0 Unknown, 609 Unchecked, 2.8s Time] [2022-11-20 21:10:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-20 21:10:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 416. [2022-11-20 21:10:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 272 states have (on average 1.0955882352941178) internal successors, (298), 282 states have internal predecessors, (298), 69 states have call successors, (69), 34 states have call predecessors, (69), 74 states have return successors, (285), 99 states have call predecessors, (285), 52 states have call successors, (285) [2022-11-20 21:10:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 652 transitions. [2022-11-20 21:10:00,954 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 652 transitions. Word has length 111 [2022-11-20 21:10:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:10:00,954 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 652 transitions. [2022-11-20 21:10:00,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (27), 7 states have call predecessors, (27), 18 states have return successors, (29), 21 states have call predecessors, (29), 18 states have call successors, (29) [2022-11-20 21:10:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 652 transitions. [2022-11-20 21:10:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 21:10:00,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:10:00,960 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 3, 3, 3, 3, 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] [2022-11-20 21:10:00,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 21:10:01,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 21:10:01,169 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:10:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:10:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash -432796201, now seen corresponding path program 2 times [2022-11-20 21:10:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:10:01,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765050786] [2022-11-20 21:10:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:10:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:10:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:10:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 21:10:03,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:10:03,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765050786] [2022-11-20 21:10:03,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765050786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:03,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540770907] [2022-11-20 21:10:03,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:10:03,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:10:03,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:10:03,464 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:10:03,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 21:10:03,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 21:10:03,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:10:03,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-20 21:10:03,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:10:03,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:10:03,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:10:03,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:10:03,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:10:03,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:10:03,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:10:04,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:10:04,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:10:04,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:10:04,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 33 [2022-11-20 21:10:04,775 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-20 21:10:04,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 21:10:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-20 21:10:04,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:10:06,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:10:08,164 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_nondet_tree_#res.offset|))) (and (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_36 Int)) (or (forall ((nondet_tree_~n~0.base Int)) (= (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 8) |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse0) 0)) (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 4) 0))) (forall ((v_nondet_tree_~n~0.offset_BEFORE_CALL_36 Int)) (or (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 4) 0) (forall ((nondet_tree_~n~0.base Int)) (= (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 8) |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse0) 0)))))) is different from false [2022-11-20 21:10:10,207 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_nondet_tree_~n~0.offset)) (.cse2 (+ 4 c_nondet_tree_~n~0.offset))) (and (forall ((v_ArrVal_1057 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_36 Int)) (or (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 4) 0) (forall ((v_subst_1 Int)) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base) .cse1 v_ArrVal_1057)))) (store .cse0 v_subst_1 (store (select .cse0 v_subst_1) (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 8) c_nondet_tree_~n~0.base))) c_nondet_tree_~n~0.base) .cse2))))) (forall ((v_ArrVal_1056 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_36 Int)) (or (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 4) 0) (forall ((v_subst_2 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| c_nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| c_nondet_tree_~n~0.base) .cse1 v_ArrVal_1056)))) (store .cse3 v_subst_2 (store (select .cse3 v_subst_2) (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_36 8) c_nondet_tree_~n~0.offset))) c_nondet_tree_~n~0.base) .cse2) 0)))))) is different from false [2022-11-20 21:10:10,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540770907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:10,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277773033] [2022-11-20 21:10:10,242 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-20 21:10:10,243 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:10:10,243 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:10:10,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:10:10,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2022-11-20 21:10:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765987606] [2022-11-20 21:10:10,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:10:10,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:10:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:10:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:10:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1938, Unknown=2, NotChecked=178, Total=2256 [2022-11-20 21:10:10,246 INFO L87 Difference]: Start difference. First operand 416 states and 652 transitions. Second operand has 36 states, 31 states have (on average 2.193548387096774) internal successors, (68), 27 states have internal predecessors, (68), 17 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (19), 18 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-20 21:10:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:10:13,977 INFO L93 Difference]: Finished difference Result 624 states and 969 transitions. [2022-11-20 21:10:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-20 21:10:13,978 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.193548387096774) internal successors, (68), 27 states have internal predecessors, (68), 17 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (19), 18 states have call predecessors, (19), 14 states have call successors, (19) Word has length 85 [2022-11-20 21:10:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:10:13,984 INFO L225 Difference]: With dead ends: 624 [2022-11-20 21:10:13,984 INFO L226 Difference]: Without dead ends: 543 [2022-11-20 21:10:13,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=534, Invalid=6954, Unknown=2, NotChecked=342, Total=7832 [2022-11-20 21:10:13,987 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 75 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 21:10:13,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 324 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1007 Invalid, 0 Unknown, 355 Unchecked, 0.9s Time] [2022-11-20 21:10:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-20 21:10:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 439. [2022-11-20 21:10:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 286 states have (on average 1.0944055944055944) internal successors, (313), 297 states have internal predecessors, (313), 73 states have call successors, (73), 35 states have call predecessors, (73), 79 states have return successors, (303), 106 states have call predecessors, (303), 56 states have call successors, (303) [2022-11-20 21:10:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 689 transitions. [2022-11-20 21:10:14,055 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 689 transitions. Word has length 85 [2022-11-20 21:10:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:10:14,056 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 689 transitions. [2022-11-20 21:10:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.193548387096774) internal successors, (68), 27 states have internal predecessors, (68), 17 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (19), 18 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-20 21:10:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 689 transitions. [2022-11-20 21:10:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 21:10:14,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:10:14,060 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:10:14,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-20 21:10:14,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 21:10:14,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:10:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:10:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1476709101, now seen corresponding path program 4 times [2022-11-20 21:10:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:10:14,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210980471] [2022-11-20 21:10:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:10:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:10:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:10:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 35 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 21:10:15,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:10:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210980471] [2022-11-20 21:10:15,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210980471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:15,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432978166] [2022-11-20 21:10:15,993 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:10:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:10:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:10:15,994 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:10:15,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 21:10:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:10:16,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-20 21:10:16,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:10:16,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:10:16,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 21:10:16,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:10:17,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:10:17,765 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-20 21:10:17,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2022-11-20 21:10:17,784 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-11-20 21:10:17,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-20 21:10:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 21:10:17,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:10:30,738 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:10:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432978166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081421084] [2022-11-20 21:10:30,782 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:10:30,783 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:10:30,783 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:10:30,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:10:30,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 39 [2022-11-20 21:10:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048619620] [2022-11-20 21:10:30,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:10:30,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 21:10:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:10:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 21:10:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2083, Unknown=1, NotChecked=0, Total=2256 [2022-11-20 21:10:30,787 INFO L87 Difference]: Start difference. First operand 439 states and 689 transitions. Second operand has 39 states, 32 states have (on average 2.03125) internal successors, (65), 30 states have internal predecessors, (65), 15 states have call successors, (17), 9 states have call predecessors, (17), 12 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-20 21:10:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:10:32,216 INFO L93 Difference]: Finished difference Result 596 states and 1022 transitions. [2022-11-20 21:10:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 21:10:32,217 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 2.03125) internal successors, (65), 30 states have internal predecessors, (65), 15 states have call successors, (17), 9 states have call predecessors, (17), 12 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 73 [2022-11-20 21:10:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:10:32,223 INFO L225 Difference]: With dead ends: 596 [2022-11-20 21:10:32,223 INFO L226 Difference]: Without dead ends: 584 [2022-11-20 21:10:32,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=335, Invalid=4356, Unknown=1, NotChecked=0, Total=4692 [2022-11-20 21:10:32,226 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:10:32,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 308 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 423 Invalid, 0 Unknown, 178 Unchecked, 0.4s Time] [2022-11-20 21:10:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-20 21:10:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 478. [2022-11-20 21:10:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 312 states have (on average 1.0961538461538463) internal successors, (342), 324 states have internal predecessors, (342), 79 states have call successors, (79), 39 states have call predecessors, (79), 86 states have return successors, (334), 114 states have call predecessors, (334), 60 states have call successors, (334) [2022-11-20 21:10:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 755 transitions. [2022-11-20 21:10:32,306 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 755 transitions. Word has length 73 [2022-11-20 21:10:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:10:32,306 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 755 transitions. [2022-11-20 21:10:32,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 2.03125) internal successors, (65), 30 states have internal predecessors, (65), 15 states have call successors, (17), 9 states have call predecessors, (17), 12 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-20 21:10:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 755 transitions. [2022-11-20 21:10:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 21:10:32,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:10:32,311 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:10:32,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 21:10:32,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:10:32,518 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:10:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:10:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1360345455, now seen corresponding path program 3 times [2022-11-20 21:10:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:10:32,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687791749] [2022-11-20 21:10:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:10:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:10:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:10:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-20 21:10:34,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:10:34,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687791749] [2022-11-20 21:10:34,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687791749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:34,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590653125] [2022-11-20 21:10:34,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:10:34,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:10:34,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:10:34,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:10:34,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 21:10:34,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:10:34,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:10:34,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-20 21:10:34,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:10:35,578 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 21:10:35,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-20 21:10:35,602 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 21:10:35,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-20 21:10:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 29 proven. 29 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-20 21:10:35,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:10:48,694 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:10:58,889 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:10:58,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590653125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:58,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [45092037] [2022-11-20 21:10:58,892 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-20 21:10:58,892 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:10:58,893 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:10:58,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:10:58,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 42 [2022-11-20 21:10:58,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71682628] [2022-11-20 21:10:58,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:10:58,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 21:10:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:10:58,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 21:10:58,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2398, Unknown=1, NotChecked=0, Total=2550 [2022-11-20 21:10:58,895 INFO L87 Difference]: Start difference. First operand 478 states and 755 transitions. Second operand has 42 states, 34 states have (on average 2.176470588235294) internal successors, (74), 32 states have internal predecessors, (74), 17 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) [2022-11-20 21:11:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:04,393 INFO L93 Difference]: Finished difference Result 1002 states and 1927 transitions. [2022-11-20 21:11:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-20 21:11:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 2.176470588235294) internal successors, (74), 32 states have internal predecessors, (74), 17 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) Word has length 73 [2022-11-20 21:11:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:04,404 INFO L225 Difference]: With dead ends: 1002 [2022-11-20 21:11:04,405 INFO L226 Difference]: Without dead ends: 864 [2022-11-20 21:11:04,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=737, Invalid=9564, Unknown=1, NotChecked=0, Total=10302 [2022-11-20 21:11:04,408 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 165 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:04,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 363 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2022 Invalid, 0 Unknown, 457 Unchecked, 1.9s Time] [2022-11-20 21:11:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-11-20 21:11:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 726. [2022-11-20 21:11:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 482 states have (on average 1.0892116182572613) internal successors, (525), 487 states have internal predecessors, (525), 107 states have call successors, (107), 59 states have call predecessors, (107), 136 states have return successors, (683), 179 states have call predecessors, (683), 82 states have call successors, (683) [2022-11-20 21:11:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1315 transitions. [2022-11-20 21:11:04,537 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1315 transitions. Word has length 73 [2022-11-20 21:11:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:04,537 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1315 transitions. [2022-11-20 21:11:04,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 2.176470588235294) internal successors, (74), 32 states have internal predecessors, (74), 17 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) [2022-11-20 21:11:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1315 transitions. [2022-11-20 21:11:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-20 21:11:04,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:04,545 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:04,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 21:11:04,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 21:11:04,752 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:11:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1813269144, now seen corresponding path program 6 times [2022-11-20 21:11:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352607151] [2022-11-20 21:11:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 35 proven. 56 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-20 21:11:07,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352607151] [2022-11-20 21:11:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352607151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:11:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335102733] [2022-11-20 21:11:07,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:11:07,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:11:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:11:07,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:11:07,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 21:11:07,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:11:07,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:11:07,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-20 21:11:07,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:11:07,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:11:07,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:11:10,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:11:10,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:10,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 45 [2022-11-20 21:11:10,220 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 21:11:10,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 27 [2022-11-20 21:11:10,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 21:11:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 28 proven. 66 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-20 21:11:10,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:11:14,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 15 [2022-11-20 21:11:16,064 INFO L321 Elim1Store]: treesize reduction 4, result has 93.2 percent of original size [2022-11-20 21:11:16,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 75 [2022-11-20 21:11:17,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:11:17,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 352 treesize of output 325 [2022-11-20 21:11:41,718 WARN L233 SmtUtils]: Spent 18.52s on a formula simplification. DAG size of input: 101 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:11:41,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335102733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:11:41,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1850894549] [2022-11-20 21:11:41,721 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:11:41,721 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:11:41,721 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:11:41,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:11:41,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 60 [2022-11-20 21:11:41,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712926598] [2022-11-20 21:11:41,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:11:41,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-20 21:11:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-20 21:11:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5016, Unknown=0, NotChecked=0, Total=5256 [2022-11-20 21:11:41,725 INFO L87 Difference]: Start difference. First operand 726 states and 1315 transitions. Second operand has 60 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (19), 17 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-20 21:11:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:44,397 INFO L93 Difference]: Finished difference Result 940 states and 1755 transitions. [2022-11-20 21:11:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-20 21:11:44,398 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (19), 17 states have call predecessors, (19), 12 states have call successors, (19) Word has length 95 [2022-11-20 21:11:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:44,411 INFO L225 Difference]: With dead ends: 940 [2022-11-20 21:11:44,411 INFO L226 Difference]: Without dead ends: 938 [2022-11-20 21:11:44,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=408, Invalid=8148, Unknown=0, NotChecked=0, Total=8556 [2022-11-20 21:11:44,415 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 491 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:44,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1125 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1038 Invalid, 0 Unknown, 491 Unchecked, 1.1s Time] [2022-11-20 21:11:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-11-20 21:11:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 863. [2022-11-20 21:11:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 571 states have (on average 1.085814360770578) internal successors, (620), 581 states have internal predecessors, (620), 119 states have call successors, (119), 66 states have call predecessors, (119), 172 states have return successors, (906), 215 states have call predecessors, (906), 92 states have call successors, (906) [2022-11-20 21:11:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1645 transitions. [2022-11-20 21:11:44,594 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1645 transitions. Word has length 95 [2022-11-20 21:11:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:44,595 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1645 transitions. [2022-11-20 21:11:44,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (19), 17 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-20 21:11:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1645 transitions. [2022-11-20 21:11:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 21:11:44,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:44,603 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:44,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 21:11:44,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 21:11:44,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:11:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -765415444, now seen corresponding path program 7 times [2022-11-20 21:11:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994525611] [2022-11-20 21:11:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 16 proven. 76 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 21:11:46,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:46,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994525611] [2022-11-20 21:11:46,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994525611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:11:46,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277489091] [2022-11-20 21:11:46,323 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:11:46,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:11:46,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:11:46,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:11:46,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 21:11:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:46,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-20 21:11:46,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:11:46,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:11:46,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:11:46,903 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 21:11:46,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 21:11:46,920 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-20 21:11:46,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:11:49,315 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-20 21:11:49,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 103 [2022-11-20 21:11:49,400 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-20 21:11:49,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 80 [2022-11-20 21:11:50,382 INFO L321 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2022-11-20 21:11:50,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 33 [2022-11-20 21:11:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-20 21:11:50,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:11:51,463 INFO L321 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2022-11-20 21:11:51,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2022-11-20 21:11:57,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:11:57,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:11:57,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:11:57,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:11:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-20 21:11:59,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277489091] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:11:59,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [439274636] [2022-11-20 21:11:59,139 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:11:59,139 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:11:59,140 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:11:59,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:11:59,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 20] total 61 [2022-11-20 21:11:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559209200] [2022-11-20 21:11:59,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:11:59,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-20 21:11:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:59,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-20 21:11:59,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3484, Unknown=0, NotChecked=0, Total=3660 [2022-11-20 21:11:59,145 INFO L87 Difference]: Start difference. First operand 863 states and 1645 transitions. Second operand has 61 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 44 states have internal predecessors, (96), 19 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (27), 20 states have call predecessors, (27), 14 states have call successors, (27) [2022-11-20 21:12:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:12:06,018 INFO L93 Difference]: Finished difference Result 1112 states and 2117 transitions. [2022-11-20 21:12:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 21:12:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 44 states have internal predecessors, (96), 19 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (27), 20 states have call predecessors, (27), 14 states have call successors, (27) Word has length 83 [2022-11-20 21:12:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:12:06,035 INFO L225 Difference]: With dead ends: 1112 [2022-11-20 21:12:06,035 INFO L226 Difference]: Without dead ends: 1073 [2022-11-20 21:12:06,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2312 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=599, Invalid=10321, Unknown=0, NotChecked=0, Total=10920 [2022-11-20 21:12:06,039 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 95 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 808 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:12:06,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 783 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1931 Invalid, 0 Unknown, 808 Unchecked, 2.1s Time] [2022-11-20 21:12:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-11-20 21:12:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 997. [2022-11-20 21:12:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 666 states have (on average 1.09009009009009) internal successors, (726), 673 states have internal predecessors, (726), 137 states have call successors, (137), 78 states have call predecessors, (137), 193 states have return successors, (1025), 245 states have call predecessors, (1025), 102 states have call successors, (1025) [2022-11-20 21:12:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1888 transitions. [2022-11-20 21:12:06,250 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1888 transitions. Word has length 83 [2022-11-20 21:12:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:12:06,251 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1888 transitions. [2022-11-20 21:12:06,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 44 states have internal predecessors, (96), 19 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (27), 20 states have call predecessors, (27), 14 states have call successors, (27) [2022-11-20 21:12:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1888 transitions. [2022-11-20 21:12:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 21:12:06,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:12:06,261 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:12:06,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 21:12:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:12:06,469 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:12:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:12:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1103090580, now seen corresponding path program 8 times [2022-11-20 21:12:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:12:06,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610608426] [2022-11-20 21:12:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:12:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:12:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:12:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 56 proven. 87 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-20 21:12:10,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:12:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610608426] [2022-11-20 21:12:10,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610608426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:12:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129380023] [2022-11-20 21:12:10,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:12:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:12:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:12:10,753 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:12:10,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 21:12:12,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 21:12:12,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:12:12,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-20 21:12:12,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:12:12,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:12:12,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:12:12,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:12:13,096 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 21:12:13,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 21:12:13,117 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-20 21:12:13,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:12:13,264 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:12:13,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:12:13,392 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 21:12:13,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 43 [2022-11-20 21:12:13,413 INFO L321 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2022-11-20 21:12:13,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2022-11-20 21:12:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 75 proven. 90 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-20 21:12:20,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:12:38,291 WARN L233 SmtUtils]: Spent 16.18s on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:12:49,135 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:12:49,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129380023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:12:49,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475165945] [2022-11-20 21:12:49,142 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:12:49,142 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:12:49,142 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:12:49,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:12:49,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 27] total 59 [2022-11-20 21:12:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568408524] [2022-11-20 21:12:49,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:12:49,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-20 21:12:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:12:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-20 21:12:49,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3839, Unknown=0, NotChecked=0, Total=4032 [2022-11-20 21:12:49,147 INFO L87 Difference]: Start difference. First operand 997 states and 1888 transitions. Second operand has 59 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 44 states have internal predecessors, (91), 20 states have call successors, (26), 7 states have call predecessors, (26), 19 states have return successors, (26), 24 states have call predecessors, (26), 16 states have call successors, (26) [2022-11-20 21:13:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:13:01,048 INFO L93 Difference]: Finished difference Result 1653 states and 3350 transitions. [2022-11-20 21:13:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-20 21:13:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 44 states have internal predecessors, (91), 20 states have call successors, (26), 7 states have call predecessors, (26), 19 states have return successors, (26), 24 states have call predecessors, (26), 16 states have call successors, (26) Word has length 107 [2022-11-20 21:13:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:13:01,075 INFO L225 Difference]: With dead ends: 1653 [2022-11-20 21:13:01,075 INFO L226 Difference]: Without dead ends: 1588 [2022-11-20 21:13:01,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5124 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=804, Invalid=17286, Unknown=0, NotChecked=0, Total=18090 [2022-11-20 21:13:01,083 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 21:13:01,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 609 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2732 Invalid, 0 Unknown, 493 Unchecked, 2.7s Time] [2022-11-20 21:13:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-11-20 21:13:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1347. [2022-11-20 21:13:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 889 states have (on average 1.0809898762654668) internal successors, (961), 904 states have internal predecessors, (961), 172 states have call successors, (172), 90 states have call predecessors, (172), 285 states have return successors, (1585), 352 states have call predecessors, (1585), 137 states have call successors, (1585) [2022-11-20 21:13:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2718 transitions. [2022-11-20 21:13:01,415 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2718 transitions. Word has length 107 [2022-11-20 21:13:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:13:01,416 INFO L495 AbstractCegarLoop]: Abstraction has 1347 states and 2718 transitions. [2022-11-20 21:13:01,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 44 states have internal predecessors, (91), 20 states have call successors, (26), 7 states have call predecessors, (26), 19 states have return successors, (26), 24 states have call predecessors, (26), 16 states have call successors, (26) [2022-11-20 21:13:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2718 transitions. [2022-11-20 21:13:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 21:13:01,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:13:01,430 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:13:01,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 21:13:01,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 21:13:01,639 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:13:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:13:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 223257687, now seen corresponding path program 4 times [2022-11-20 21:13:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:13:01,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999526860] [2022-11-20 21:13:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:13:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:13:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:13:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 63 proven. 80 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-20 21:13:05,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:13:05,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999526860] [2022-11-20 21:13:05,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999526860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:13:05,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647309825] [2022-11-20 21:13:05,483 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:13:05,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:13:05,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:13:05,485 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:13:05,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 21:13:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:13:05,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-20 21:13:05,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:13:05,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 21:13:05,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:13:05,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:13:05,968 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:13:05,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:13:05,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:13:05,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:13:09,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:13:09,952 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-20 21:13:09,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 77 [2022-11-20 21:13:09,983 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-11-20 21:13:09,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 26 [2022-11-20 21:13:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 68 proven. 84 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 21:13:09,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:13:23,999 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:13:34,635 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:13:34,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647309825] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:13:34,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [947838476] [2022-11-20 21:13:34,637 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-20 21:13:34,637 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:13:34,638 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:13:34,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:13:34,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 55 [2022-11-20 21:13:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662225445] [2022-11-20 21:13:34,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:13:34,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-20 21:13:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:13:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-20 21:13:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4329, Unknown=1, NotChecked=0, Total=4556 [2022-11-20 21:13:34,645 INFO L87 Difference]: Start difference. First operand 1347 states and 2718 transitions. Second operand has 55 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 21 states have call successors, (24), 11 states have call predecessors, (24), 16 states have return successors, (20), 18 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-20 21:13:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:13:41,459 INFO L93 Difference]: Finished difference Result 3164 states and 7775 transitions. [2022-11-20 21:13:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-11-20 21:13:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 21 states have call successors, (24), 11 states have call predecessors, (24), 16 states have return successors, (20), 18 states have call predecessors, (20), 14 states have call successors, (20) Word has length 101 [2022-11-20 21:13:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:13:41,526 INFO L225 Difference]: With dead ends: 3164 [2022-11-20 21:13:41,527 INFO L226 Difference]: Without dead ends: 3152 [2022-11-20 21:13:41,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4645 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=842, Invalid=15927, Unknown=1, NotChecked=0, Total=16770 [2022-11-20 21:13:41,536 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 925 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:13:41,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 758 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1532 Invalid, 0 Unknown, 925 Unchecked, 1.5s Time] [2022-11-20 21:13:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2022-11-20 21:13:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 2169. [2022-11-20 21:13:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1438 states have (on average 1.0778859527121) internal successors, (1550), 1457 states have internal predecessors, (1550), 229 states have call successors, (229), 132 states have call predecessors, (229), 501 states have return successors, (3268), 579 states have call predecessors, (3268), 185 states have call successors, (3268) [2022-11-20 21:13:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 5047 transitions. [2022-11-20 21:13:42,342 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 5047 transitions. Word has length 101 [2022-11-20 21:13:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:13:42,343 INFO L495 AbstractCegarLoop]: Abstraction has 2169 states and 5047 transitions. [2022-11-20 21:13:42,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 21 states have call successors, (24), 11 states have call predecessors, (24), 16 states have return successors, (20), 18 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-20 21:13:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 5047 transitions. [2022-11-20 21:13:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 21:13:42,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:13:42,361 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:13:42,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 21:13:42,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:13:42,569 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:13:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:13:42,570 INFO L85 PathProgramCache]: Analyzing trace with hash 339621333, now seen corresponding path program 9 times [2022-11-20 21:13:42,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:13:42,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871488088] [2022-11-20 21:13:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:13:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:13:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:13:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 19 proven. 91 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-20 21:13:46,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:13:46,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871488088] [2022-11-20 21:13:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871488088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:13:46,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213570425] [2022-11-20 21:13:46,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:13:46,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:13:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:13:46,017 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:13:46,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 21:13:46,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:13:46,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:13:46,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-20 21:13:46,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:13:46,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 21:13:49,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:13:49,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:13:49,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 104 [2022-11-20 21:13:49,279 INFO L321 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2022-11-20 21:13:49,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 52 [2022-11-20 21:13:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 58 proven. 51 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-20 21:13:49,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:14:01,169 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:14:11,557 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:14:11,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213570425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:14:11,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1233248545] [2022-11-20 21:14:11,560 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 21:14:11,560 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:14:11,560 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-20 21:14:11,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:14:11,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2022-11-20 21:14:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930584666] [2022-11-20 21:14:11,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:14:11,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 21:14:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:14:11,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 21:14:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3817, Unknown=0, NotChecked=0, Total=4032 [2022-11-20 21:14:11,564 INFO L87 Difference]: Start difference. First operand 2169 states and 5047 transitions. Second operand has 51 states, 43 states have (on average 2.13953488372093) internal successors, (92), 38 states have internal predecessors, (92), 18 states have call successors, (27), 10 states have call predecessors, (27), 13 states have return successors, (24), 19 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-20 21:14:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:14:17,717 INFO L93 Difference]: Finished difference Result 3926 states and 9781 transitions. [2022-11-20 21:14:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-20 21:14:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 2.13953488372093) internal successors, (92), 38 states have internal predecessors, (92), 18 states have call successors, (27), 10 states have call predecessors, (27), 13 states have return successors, (24), 19 states have call predecessors, (24), 12 states have call successors, (24) Word has length 101 [2022-11-20 21:14:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:14:17,779 INFO L225 Difference]: With dead ends: 3926 [2022-11-20 21:14:17,779 INFO L226 Difference]: Without dead ends: 3875 [2022-11-20 21:14:17,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2071 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=552, Invalid=10368, Unknown=0, NotChecked=0, Total=10920 [2022-11-20 21:14:17,787 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 96 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1229 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:14:17,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 967 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1336 Invalid, 0 Unknown, 1229 Unchecked, 1.4s Time] [2022-11-20 21:14:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2022-11-20 21:14:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3196. [2022-11-20 21:14:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 2135 states have (on average 1.0754098360655737) internal successors, (2296), 2149 states have internal predecessors, (2296), 320 states have call successors, (320), 190 states have call predecessors, (320), 740 states have return successors, (5919), 856 states have call predecessors, (5919), 250 states have call successors, (5919) [2022-11-20 21:14:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 8535 transitions. [2022-11-20 21:14:18,685 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 8535 transitions. Word has length 101 [2022-11-20 21:14:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:14:18,686 INFO L495 AbstractCegarLoop]: Abstraction has 3196 states and 8535 transitions. [2022-11-20 21:14:18,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 2.13953488372093) internal successors, (92), 38 states have internal predecessors, (92), 18 states have call successors, (27), 10 states have call predecessors, (27), 13 states have return successors, (24), 19 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-20 21:14:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 8535 transitions. [2022-11-20 21:14:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-20 21:14:18,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:14:18,709 INFO L195 NwaCegarLoop]: trace histogram [17, 9, 8, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:14:18,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 21:14:18,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25efeaab-2911-4c8f-a143-284fcee7288c/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:14:18,918 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:14:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:14:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1708276655, now seen corresponding path program 10 times [2022-11-20 21:14:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:14:18,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911764637] [2022-11-20 21:14:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:14:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:14:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat