./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_stack-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- 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-2329fc7 [2022-12-13 16:28:57,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:28:57,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:28:57,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:28:57,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:28:57,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:28:57,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:28:57,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:28:57,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:28:57,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:28:57,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:28:57,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:28:57,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:28:57,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:28:57,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:28:57,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:28:57,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:28:57,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:28:57,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:28:57,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:28:57,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:28:57,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:28:57,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:28:57,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:28:57,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:28:57,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:28:57,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:28:57,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:28:57,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:28:57,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:28:57,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:28:57,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:28:57,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:28:57,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:28:57,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:28:57,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:28:57,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:28:57,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:28:57,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:28:57,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:28:57,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:28:57,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:28:57,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:28:57,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:28:57,794 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:28:57,794 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:28:57,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:28:57,795 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:28:57,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:28:57,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:28:57,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:28:57,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:28:57,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:28:57,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:28:57,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:28:57,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:28:57,799 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:28:57,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:28:57,799 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:28:57,799 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/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_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2022-12-13 16:28:57,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:28:57,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:28:57,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:28:57,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:28:57,976 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:28:57,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2022-12-13 16:29:00,410 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:29:00,658 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:29:00,659 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2022-12-13 16:29:00,672 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/data/734a5032f/25c5006cb4bb48258b542ea6fe0fd947/FLAGa10fcbb14 [2022-12-13 16:29:00,988 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/data/734a5032f/25c5006cb4bb48258b542ea6fe0fd947 [2022-12-13 16:29:00,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:29:00,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:29:00,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:29:00,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:29:00,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:29:00,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:29:00" (1/1) ... [2022-12-13 16:29:00,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f8611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:00, skipping insertion in model container [2022-12-13 16:29:01,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:29:00" (1/1) ... [2022-12-13 16:29:01,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:29:01,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:29:01,327 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_11245233-5dbd-47a3-847f-6e87e1032bff/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2022-12-13 16:29:01,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:29:01,411 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:29:01,440 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_11245233-5dbd-47a3-847f-6e87e1032bff/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2022-12-13 16:29:01,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:29:01,525 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:29:01,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01 WrapperNode [2022-12-13 16:29:01,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:29:01,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:29:01,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:29:01,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:29:01,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,591 INFO L138 Inliner]: procedures = 252, calls = 268, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 601 [2022-12-13 16:29:01,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:29:01,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:29:01,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:29:01,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:29:01,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,625 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:29:01,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:29:01,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:29:01,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:29:01,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (1/1) ... [2022-12-13 16:29:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:29:01,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:29:01,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:29:01,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:29:01,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 16:29:01,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 16:29:01,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-12-13 16:29:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-12-13 16:29:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2022-12-13 16:29:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2022-12-13 16:29:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-12-13 16:29:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-12-13 16:29:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-12-13 16:29:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 16:29:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-12-13 16:29:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-12-13 16:29:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:29:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:29:01,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:29:01,838 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:29:01,840 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:29:01,884 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:01,884 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != ~__CS_ret~0 % 256;#res := 0; [2022-12-13 16:29:01,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume 0 != ~__CS_ret~0 % 256; [2022-12-13 16:29:01,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:01,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:01,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != ~__CS_ret~0 % 256; [2022-12-13 16:29:01,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != ~__CS_ret~0 % 256; [2022-12-13 16:29:01,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:01,912 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:01,912 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != ~__CS_ret~0 % 256; [2022-12-13 16:29:01,912 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2022-12-13 16:29:02,196 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:02,196 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != ~__CS_ret~0 % 256;push_#res#1 := 0; [2022-12-13 16:29:02,196 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:02,196 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-12-13 16:29:02,196 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:02,196 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume 0 != ~__CS_ret~0 % 256;pop_#res#1 := 0; [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume !(0 != ~__CS_ret~0 % 256);pop_#res#1 := 0; [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != ~__CS_ret~0 % 256;push_#res#1 := 0; [2022-12-13 16:29:02,197 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != ~__CS_ret~0 % 256); [2022-12-13 16:29:04,475 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:29:04,482 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:29:04,482 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:29:04,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:29:04 BoogieIcfgContainer [2022-12-13 16:29:04,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:29:04,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:29:04,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:29:04,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:29:04,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:29:00" (1/3) ... [2022-12-13 16:29:04,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e879e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:29:04, skipping insertion in model container [2022-12-13 16:29:04,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:29:01" (2/3) ... [2022-12-13 16:29:04,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e879e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:29:04, skipping insertion in model container [2022-12-13 16:29:04,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:29:04" (3/3) ... [2022-12-13 16:29:04,492 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2022-12-13 16:29:04,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:29:04,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:29:04,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:29:04,559 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74e7b036, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:29:04,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:29:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 137 states have internal predecessors, (203), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-12-13 16:29:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-13 16:29:04,584 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:29:04,584 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 16:29:04,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:29:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:29:04,590 INFO L85 PathProgramCache]: Analyzing trace with hash 726696115, now seen corresponding path program 1 times [2022-12-13 16:29:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:29:04,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857005972] [2022-12-13 16:29:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:29:04,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:29:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:29:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 16:29:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:29:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:29:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:29:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 16:29:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:29:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:29:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:29:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:29:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:29:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:29:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 16:29:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:29:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-12-13 16:29:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:29:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857005972] [2022-12-13 16:29:13,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857005972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:29:13,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:29:13,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:29:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982376548] [2022-12-13 16:29:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:29:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:29:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:29:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:29:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:29:13,933 INFO L87 Difference]: Start difference. First operand has 220 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 137 states have internal predecessors, (203), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:29:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:29:14,013 INFO L93 Difference]: Finished difference Result 436 states and 769 transitions. [2022-12-13 16:29:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:29:14,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-12-13 16:29:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:29:14,025 INFO L225 Difference]: With dead ends: 436 [2022-12-13 16:29:14,025 INFO L226 Difference]: Without dead ends: 216 [2022-12-13 16:29:14,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:29:14,034 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:29:14,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:29:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-13 16:29:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-12-13 16:29:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 133 states have internal predecessors, (195), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-12-13 16:29:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 345 transitions. [2022-12-13 16:29:14,090 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 345 transitions. Word has length 94 [2022-12-13 16:29:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:29:14,090 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 345 transitions. [2022-12-13 16:29:14,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:29:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2022-12-13 16:29:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-13 16:29:14,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:29:14,096 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 16:29:14,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:29:14,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:29:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:29:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 112214679, now seen corresponding path program 1 times [2022-12-13 16:29:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:29:14,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414270892] [2022-12-13 16:29:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:29:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:29:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 16:29:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 16:29:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:29:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:29:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:29:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 16:29:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:29:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:29:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:29:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:29:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:29:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:29:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 16:29:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:29:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:29:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-12-13 16:29:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:29:37,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414270892] [2022-12-13 16:29:37,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414270892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:29:37,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:29:37,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:29:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506842916] [2022-12-13 16:29:37,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:29:37,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:29:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:29:37,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:29:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:29:37,884 INFO L87 Difference]: Start difference. First operand 216 states and 345 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-13 16:29:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:29:37,946 INFO L93 Difference]: Finished difference Result 428 states and 693 transitions. [2022-12-13 16:29:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:29:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2022-12-13 16:29:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:29:37,953 INFO L225 Difference]: With dead ends: 428 [2022-12-13 16:29:37,953 INFO L226 Difference]: Without dead ends: 394 [2022-12-13 16:29:37,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:29:37,955 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 304 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:29:37,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:29:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-12-13 16:29:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2022-12-13 16:29:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 239 states have (on average 1.5230125523012552) internal successors, (364), 243 states have internal predecessors, (364), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2022-12-13 16:29:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 642 transitions. [2022-12-13 16:29:37,982 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 642 transitions. Word has length 94 [2022-12-13 16:29:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:29:37,983 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 642 transitions. [2022-12-13 16:29:37,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-13 16:29:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 642 transitions. [2022-12-13 16:29:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-13 16:29:37,986 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:29:37,986 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 16:29:37,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:29:37,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:29:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:29:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash 203580110, now seen corresponding path program 1 times [2022-12-13 16:29:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:29:37,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364110282] [2022-12-13 16:29:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:29:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:29:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 16:30:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:30:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 16:30:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:30:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:30:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:30:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:30:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:30:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:30:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 16:30:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:30:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:30:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 16:30:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 16:30:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 16:30:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 16:30:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:30:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 16:30:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 16:30:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-12-13 16:30:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 16:30:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2022-12-13 16:30:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:04,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364110282] [2022-12-13 16:30:04,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364110282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:04,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:04,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:30:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960752348] [2022-12-13 16:30:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:04,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:30:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:04,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:30:04,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:30:04,137 INFO L87 Difference]: Start difference. First operand 393 states and 642 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2022-12-13 16:30:06,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:30:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:07,985 INFO L93 Difference]: Finished difference Result 1176 states and 1997 transitions. [2022-12-13 16:30:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:30:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 177 [2022-12-13 16:30:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:07,995 INFO L225 Difference]: With dead ends: 1176 [2022-12-13 16:30:07,995 INFO L226 Difference]: Without dead ends: 1138 [2022-12-13 16:30:07,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:30:07,998 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 765 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 794 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:07,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1138 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 1581 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-12-13 16:30:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-12-13 16:30:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 887. [2022-12-13 16:30:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 535 states have (on average 1.530841121495327) internal successors, (819), 555 states have internal predecessors, (819), 306 states have call successors, (306), 36 states have call predecessors, (306), 45 states have return successors, (355), 305 states have call predecessors, (355), 306 states have call successors, (355) [2022-12-13 16:30:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1480 transitions. [2022-12-13 16:30:08,102 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1480 transitions. Word has length 177 [2022-12-13 16:30:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1480 transitions. [2022-12-13 16:30:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2022-12-13 16:30:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1480 transitions. [2022-12-13 16:30:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-13 16:30:08,113 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:08,113 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 16:30:08,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:30:08,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:08,114 INFO L85 PathProgramCache]: Analyzing trace with hash -899337024, now seen corresponding path program 1 times [2022-12-13 16:30:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:08,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215921065] [2022-12-13 16:30:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 16:30:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:30:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 16:30:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:30:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:30:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:30:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:30:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:30:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:30:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:30:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 16:30:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 16:30:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 16:30:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 16:30:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 16:30:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 16:30:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 16:30:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-12-13 16:30:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 16:30:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-12-13 16:30:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-12-13 16:30:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2022-12-13 16:30:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:33,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215921065] [2022-12-13 16:30:33,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215921065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:33,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:33,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:30:33,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268132442] [2022-12-13 16:30:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:33,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:30:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:33,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:30:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:30:33,521 INFO L87 Difference]: Start difference. First operand 887 states and 1480 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-12-13 16:30:35,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:30:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:36,677 INFO L93 Difference]: Finished difference Result 1771 states and 2936 transitions. [2022-12-13 16:30:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:30:36,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2022-12-13 16:30:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:36,683 INFO L225 Difference]: With dead ends: 1771 [2022-12-13 16:30:36,683 INFO L226 Difference]: Without dead ends: 888 [2022-12-13 16:30:36,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:30:36,687 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 497 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 449 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:36,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1339 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 968 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 16:30:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-12-13 16:30:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 870. [2022-12-13 16:30:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 526 states have (on average 1.5247148288973384) internal successors, (802), 546 states have internal predecessors, (802), 298 states have call successors, (298), 35 states have call predecessors, (298), 45 states have return successors, (340), 298 states have call predecessors, (340), 298 states have call successors, (340) [2022-12-13 16:30:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1440 transitions. [2022-12-13 16:30:36,746 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1440 transitions. Word has length 173 [2022-12-13 16:30:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:36,746 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1440 transitions. [2022-12-13 16:30:36,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-12-13 16:30:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1440 transitions. [2022-12-13 16:30:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-13 16:30:36,751 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:36,752 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 16:30:36,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:30:36,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1581852266, now seen corresponding path program 1 times [2022-12-13 16:30:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:36,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794057049] [2022-12-13 16:30:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:31:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:31:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 16:31:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:31:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 16:31:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:31:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 16:31:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:31:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:31:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:31:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:31:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 16:31:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 16:31:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 16:31:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 16:31:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 16:31:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 16:31:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 16:31:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-12-13 16:31:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 16:31:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-12-13 16:31:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-12-13 16:31:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2022-12-13 16:31:00,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:31:00,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794057049] [2022-12-13 16:31:00,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794057049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:31:00,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:31:00,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:31:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136606590] [2022-12-13 16:31:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:31:00,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:31:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:31:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:31:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:31:00,613 INFO L87 Difference]: Start difference. First operand 870 states and 1440 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-12-13 16:31:02,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:31:04,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:31:06,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:31:08,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 16:31:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:31:10,085 INFO L93 Difference]: Finished difference Result 1351 states and 2182 transitions. [2022-12-13 16:31:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:31:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2022-12-13 16:31:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:31:10,089 INFO L225 Difference]: With dead ends: 1351 [2022-12-13 16:31:10,090 INFO L226 Difference]: Without dead ends: 798 [2022-12-13 16:31:10,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:31:10,092 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 497 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 223 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:31:10,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1225 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1420 Invalid, 4 Unknown, 0 Unchecked, 9.3s Time] [2022-12-13 16:31:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-12-13 16:31:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 687. [2022-12-13 16:31:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 422 states have (on average 1.4763033175355451) internal successors, (623), 436 states have internal predecessors, (623), 220 states have call successors, (220), 35 states have call predecessors, (220), 44 states have return successors, (250), 221 states have call predecessors, (250), 220 states have call successors, (250) [2022-12-13 16:31:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1093 transitions. [2022-12-13 16:31:10,139 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1093 transitions. Word has length 173 [2022-12-13 16:31:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:31:10,139 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 1093 transitions. [2022-12-13 16:31:10,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-12-13 16:31:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1093 transitions. [2022-12-13 16:31:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-13 16:31:10,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:31:10,143 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 16:31:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:31:10,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:31:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:31:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -63509980, now seen corresponding path program 1 times [2022-12-13 16:31:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:31:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748316855] [2022-12-13 16:31:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:31:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:31:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:31:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 16:31:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:31:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 16:31:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:31:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:31:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:31:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:31:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:31:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:31:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-12-13 16:31:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:31:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:31:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 16:31:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 16:31:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 16:31:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 16:31:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:31:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 16:31:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 16:31:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-12-13 16:31:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 16:31:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2022-12-13 16:31:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:31:38,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748316855] [2022-12-13 16:31:38,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748316855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:31:38,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893397822] [2022-12-13 16:31:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:31:38,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:31:38,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:31:38,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11245233-5dbd-47a3-847f-6e87e1032bff/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:31:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:56,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 17288 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 16:31:56,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:31:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:31:56,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:31:56,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:32:01,884 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 307 DAG size of output: 95 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 16:32:01,885 INFO L321 Elim1Store]: treesize reduction 1470, result has 21.0 percent of original size [2022-12-13 16:32:01,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 1178 treesize of output 1617 [2022-12-13 16:32:02,125 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 8 treesize of output 7 [2022-12-13 16:32:02,363 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 8 treesize of output 7 [2022-12-13 16:32:02,598 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 8 treesize of output 7 [2022-12-13 16:32:02,851 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 8 treesize of output 7 [2022-12-13 16:32:03,079 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 8 treesize of output 7 [2022-12-13 16:34:19,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:34:19,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:34:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:34:19,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:34:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:34:19,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:36:27,154 WARN L233 SmtUtils]: Spent 2.13m on a formula simplification. DAG size of input: 862 DAG size of output: 126 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-13 16:36:27,155 INFO L321 Elim1Store]: treesize reduction 4891, result has 4.6 percent of original size [2022-12-13 16:36:27,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 116 case distinctions, treesize of input 21062 treesize of output 21791 [2022-12-13 16:36:50,960 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 5 treesize of output 3 [2022-12-13 16:38:15,555 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 5 treesize of output 3 [2022-12-13 16:38:32,260 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 5 treesize of output 3 [2022-12-13 16:38:41,605 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 5 treesize of output 3