./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:55:43,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:55:43,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:55:44,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:55:44,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:55:44,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:55:44,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:55:44,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:55:44,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:55:44,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:55:44,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:55:44,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:55:44,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:55:44,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:55:44,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:55:44,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:55:44,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:55:44,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:55:44,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:55:44,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:55:44,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:55:44,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:55:44,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:55:44,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:55:44,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:55:44,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:55:44,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:55:44,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:55:44,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:55:44,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:55:44,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:55:44,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:55:44,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:55:44,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:55:44,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:55:44,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:55:44,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:55:44,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:55:44,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:55:44,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:55:44,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:55:44,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-29 04:55:44,174 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:55:44,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:55:44,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:55:44,185 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:55:44,185 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:55:44,185 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:55:44,186 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:55:44,186 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:55:44,186 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:55:44,186 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:55:44,188 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:55:44,188 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:55:44,189 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:55:44,189 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:55:44,189 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:55:44,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:55:44,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:55:44,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:55:44,191 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:55:44,191 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 04:55:44,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:55:44,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:55:44,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:55:44,193 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 04:55:44,193 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 04:55:44,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:55:44,195 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:55:44,195 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:55:44,196 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:55:44,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:55:44,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:55:44,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:55:44,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:55:44,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:55:44,198 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:55:44,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:55:44,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:55:44,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:55:44,199 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/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_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG 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 valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2021-10-29 04:55:44,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:55:44,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:55:44,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:55:44,622 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:55:44,626 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:55:44,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-10-29 04:55:44,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/data/af3ac6ff9/96a1629070d741f092768a7669a5a5ea/FLAG180b6e849 [2021-10-29 04:55:45,319 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:55:45,320 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-10-29 04:55:45,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/data/af3ac6ff9/96a1629070d741f092768a7669a5a5ea/FLAG180b6e849 [2021-10-29 04:55:45,584 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/data/af3ac6ff9/96a1629070d741f092768a7669a5a5ea [2021-10-29 04:55:45,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:55:45,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:55:45,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:55:45,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:55:45,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:55:45,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:55:45" (1/1) ... [2021-10-29 04:55:45,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102d0b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:45, skipping insertion in model container [2021-10-29 04:55:45,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:55:45" (1/1) ... [2021-10-29 04:55:45,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:55:45,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:55:46,070 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-10-29 04:55:46,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:55:46,149 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:55:46,212 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-10-29 04:55:46,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:55:46,264 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:55:46,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46 WrapperNode [2021-10-29 04:55:46,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:55:46,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:55:46,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:55:46,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:55:46,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:55:46,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:55:46,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:55:46,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:55:46,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:55:46,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:55:46,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:55:46,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:55:46,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (1/1) ... [2021-10-29 04:55:46,444 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:55:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:55:46,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:55:46,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:55:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-29 04:55:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-29 04:55:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:55:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-29 04:55:46,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 04:55:46,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-29 04:55:46,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:55:46,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:55:46,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:55:48,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:55:48,232 INFO L299 CfgBuilder]: Removed 137 assume(true) statements. [2021-10-29 04:55:48,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:55:48 BoogieIcfgContainer [2021-10-29 04:55:48,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:55:48,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:55:48,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:55:48,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:55:48,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:55:45" (1/3) ... [2021-10-29 04:55:48,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4a46eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:55:48, skipping insertion in model container [2021-10-29 04:55:48,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:55:46" (2/3) ... [2021-10-29 04:55:48,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4a46eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:55:48, skipping insertion in model container [2021-10-29 04:55:48,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:55:48" (3/3) ... [2021-10-29 04:55:48,253 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2021-10-29 04:55:48,264 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:55:48,264 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2021-10-29 04:55:48,308 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:55:48,313 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:55:48,314 INFO L340 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2021-10-29 04:55:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-29 04:55:48,343 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:48,344 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-29 04:55:48,344 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash 883824, now seen corresponding path program 1 times [2021-10-29 04:55:48,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:48,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193144431] [2021-10-29 04:55:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:48,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:48,567 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:48,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193144431] [2021-10-29 04:55:48,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193144431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:48,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:48,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:55:48,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512440021] [2021-10-29 04:55:48,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:55:48,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:55:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:55:48,623 INFO L87 Difference]: Start difference. First operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:48,878 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2021-10-29 04:55:48,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:55:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-29 04:55:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:48,895 INFO L225 Difference]: With dead ends: 278 [2021-10-29 04:55:48,895 INFO L226 Difference]: Without dead ends: 277 [2021-10-29 04:55:48,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:55:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-29 04:55:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2021-10-29 04:55:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 144 states have (on average 2.0) internal successors, (288), 275 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 288 transitions. [2021-10-29 04:55:48,958 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 288 transitions. Word has length 3 [2021-10-29 04:55:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:48,959 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 288 transitions. [2021-10-29 04:55:48,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 288 transitions. [2021-10-29 04:55:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-29 04:55:48,960 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:48,961 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-29 04:55:48,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:55:48,961 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash 883825, now seen corresponding path program 1 times [2021-10-29 04:55:48,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:48,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530317637] [2021-10-29 04:55:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:48,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:49,037 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:49,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530317637] [2021-10-29 04:55:49,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530317637] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:49,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:49,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:55:49,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309324114] [2021-10-29 04:55:49,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:55:49,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:55:49,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:55:49,043 INFO L87 Difference]: Start difference. First operand 276 states and 288 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:49,268 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2021-10-29 04:55:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:55:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-29 04:55:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:49,272 INFO L225 Difference]: With dead ends: 271 [2021-10-29 04:55:49,272 INFO L226 Difference]: Without dead ends: 271 [2021-10-29 04:55:49,273 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:55:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-29 04:55:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2021-10-29 04:55:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.9583333333333333) internal successors, (282), 269 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 282 transitions. [2021-10-29 04:55:49,304 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 282 transitions. Word has length 3 [2021-10-29 04:55:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:49,305 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 282 transitions. [2021-10-29 04:55:49,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 282 transitions. [2021-10-29 04:55:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-29 04:55:49,306 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:49,306 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-29 04:55:49,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:55:49,312 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 849381547, now seen corresponding path program 1 times [2021-10-29 04:55:49,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:49,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527059214] [2021-10-29 04:55:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:49,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:49,524 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:49,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527059214] [2021-10-29 04:55:49,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527059214] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:49,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:49,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:49,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340459331] [2021-10-29 04:55:49,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:55:49,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:55:49,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:49,530 INFO L87 Difference]: Start difference. First operand 270 states and 282 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:49,869 INFO L93 Difference]: Finished difference Result 262 states and 274 transitions. [2021-10-29 04:55:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:49,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-29 04:55:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:49,872 INFO L225 Difference]: With dead ends: 262 [2021-10-29 04:55:49,873 INFO L226 Difference]: Without dead ends: 262 [2021-10-29 04:55:49,873 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:55:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-29 04:55:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-10-29 04:55:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 144 states have (on average 1.8958333333333333) internal successors, (273), 260 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 273 transitions. [2021-10-29 04:55:49,889 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 273 transitions. Word has length 5 [2021-10-29 04:55:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:49,889 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 273 transitions. [2021-10-29 04:55:49,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 273 transitions. [2021-10-29 04:55:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-29 04:55:49,891 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:49,891 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-29 04:55:49,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:55:49,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 849381548, now seen corresponding path program 1 times [2021-10-29 04:55:49,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:49,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010157882] [2021-10-29 04:55:49,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:49,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:49,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:49,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010157882] [2021-10-29 04:55:49,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010157882] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:49,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:49,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:55:49,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362967742] [2021-10-29 04:55:49,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:55:49,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:55:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:49,989 INFO L87 Difference]: Start difference. First operand 261 states and 273 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:50,287 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2021-10-29 04:55:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:55:50,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-29 04:55:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:50,290 INFO L225 Difference]: With dead ends: 253 [2021-10-29 04:55:50,290 INFO L226 Difference]: Without dead ends: 253 [2021-10-29 04:55:50,291 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-29 04:55:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-10-29 04:55:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-29 04:55:50,301 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 5 [2021-10-29 04:55:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:50,302 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-29 04:55:50,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-29 04:55:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 04:55:50,303 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:50,303 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 04:55:50,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:55:50,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 561024176, now seen corresponding path program 1 times [2021-10-29 04:55:50,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:50,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816746825] [2021-10-29 04:55:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:50,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:50,354 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:50,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816746825] [2021-10-29 04:55:50,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816746825] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:50,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:50,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:50,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020519536] [2021-10-29 04:55:50,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:55:50,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:55:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:50,358 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:50,590 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2021-10-29 04:55:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:50,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-29 04:55:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:50,593 INFO L225 Difference]: With dead ends: 250 [2021-10-29 04:55:50,593 INFO L226 Difference]: Without dead ends: 250 [2021-10-29 04:55:50,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-29 04:55:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-10-29 04:55:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 144 states have (on average 1.8125) internal successors, (261), 248 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 261 transitions. [2021-10-29 04:55:50,611 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 261 transitions. Word has length 6 [2021-10-29 04:55:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:50,611 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 261 transitions. [2021-10-29 04:55:50,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 261 transitions. [2021-10-29 04:55:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 04:55:50,613 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:50,613 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 04:55:50,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:55:50,613 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash 561024177, now seen corresponding path program 1 times [2021-10-29 04:55:50,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:50,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719190173] [2021-10-29 04:55:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:50,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:50,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:50,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719190173] [2021-10-29 04:55:50,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719190173] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:50,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:50,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:50,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899881866] [2021-10-29 04:55:50,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:55:50,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:55:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:50,716 INFO L87 Difference]: Start difference. First operand 249 states and 261 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:50,923 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2021-10-29 04:55:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:50,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-29 04:55:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:50,926 INFO L225 Difference]: With dead ends: 247 [2021-10-29 04:55:50,926 INFO L226 Difference]: Without dead ends: 247 [2021-10-29 04:55:50,926 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-29 04:55:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-10-29 04:55:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 144 states have (on average 1.7916666666666667) internal successors, (258), 245 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 258 transitions. [2021-10-29 04:55:50,935 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 258 transitions. Word has length 6 [2021-10-29 04:55:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:50,935 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 258 transitions. [2021-10-29 04:55:50,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 258 transitions. [2021-10-29 04:55:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 04:55:50,937 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:50,937 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:50,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:55:50,938 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash -654503221, now seen corresponding path program 1 times [2021-10-29 04:55:50,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:50,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777774447] [2021-10-29 04:55:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:50,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:51,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:51,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777774447] [2021-10-29 04:55:51,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777774447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:51,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:51,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:55:51,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667564519] [2021-10-29 04:55:51,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:55:51,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:55:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:51,149 INFO L87 Difference]: Start difference. First operand 246 states and 258 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:51,438 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2021-10-29 04:55:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 04:55:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:51,441 INFO L225 Difference]: With dead ends: 245 [2021-10-29 04:55:51,441 INFO L226 Difference]: Without dead ends: 245 [2021-10-29 04:55:51,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-29 04:55:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-10-29 04:55:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7847222222222223) internal successors, (257), 244 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 257 transitions. [2021-10-29 04:55:51,450 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 257 transitions. Word has length 10 [2021-10-29 04:55:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:51,451 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 257 transitions. [2021-10-29 04:55:51,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 257 transitions. [2021-10-29 04:55:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 04:55:51,453 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:51,454 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:51,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:55:51,454 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -654503222, now seen corresponding path program 1 times [2021-10-29 04:55:51,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:51,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254986186] [2021-10-29 04:55:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:51,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:51,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:51,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254986186] [2021-10-29 04:55:51,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254986186] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:51,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:51,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:55:51,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609780753] [2021-10-29 04:55:51,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:55:51,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:55:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:55:51,663 INFO L87 Difference]: Start difference. First operand 245 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:51,850 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2021-10-29 04:55:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:55:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 04:55:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:51,852 INFO L225 Difference]: With dead ends: 244 [2021-10-29 04:55:51,852 INFO L226 Difference]: Without dead ends: 244 [2021-10-29 04:55:51,852 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:55:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-29 04:55:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-10-29 04:55:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 144 states have (on average 1.7777777777777777) internal successors, (256), 243 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2021-10-29 04:55:51,858 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 10 [2021-10-29 04:55:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:51,859 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2021-10-29 04:55:51,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2021-10-29 04:55:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 04:55:51,862 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:51,862 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:51,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:55:51,863 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1226462896, now seen corresponding path program 1 times [2021-10-29 04:55:51,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:51,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669868727] [2021-10-29 04:55:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:51,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:52,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:52,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669868727] [2021-10-29 04:55:52,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669868727] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:52,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:52,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:55:52,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403539453] [2021-10-29 04:55:52,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 04:55:52,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:52,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 04:55:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:55:52,105 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:52,362 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-10-29 04:55:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:55:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-29 04:55:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:52,365 INFO L225 Difference]: With dead ends: 243 [2021-10-29 04:55:52,365 INFO L226 Difference]: Without dead ends: 243 [2021-10-29 04:55:52,365 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:55:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-10-29 04:55:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-10-29 04:55:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 242 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 255 transitions. [2021-10-29 04:55:52,372 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 255 transitions. Word has length 14 [2021-10-29 04:55:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:52,372 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 255 transitions. [2021-10-29 04:55:52,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 255 transitions. [2021-10-29 04:55:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 04:55:52,373 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:52,373 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:52,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:55:52,374 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:52,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1226462897, now seen corresponding path program 1 times [2021-10-29 04:55:52,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:52,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677733009] [2021-10-29 04:55:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:52,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:52,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:52,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677733009] [2021-10-29 04:55:52,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677733009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:52,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:52,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:55:52,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265530194] [2021-10-29 04:55:52,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:55:52,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:52,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:55:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:52,494 INFO L87 Difference]: Start difference. First operand 243 states and 255 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:52,771 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2021-10-29 04:55:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-29 04:55:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:52,773 INFO L225 Difference]: With dead ends: 242 [2021-10-29 04:55:52,774 INFO L226 Difference]: Without dead ends: 242 [2021-10-29 04:55:52,774 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:55:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-29 04:55:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-29 04:55:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 241 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2021-10-29 04:55:52,780 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 14 [2021-10-29 04:55:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:52,780 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2021-10-29 04:55:52,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2021-10-29 04:55:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:55:52,782 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:52,782 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:52,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 04:55:52,782 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 640226691, now seen corresponding path program 1 times [2021-10-29 04:55:52,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:52,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904309820] [2021-10-29 04:55:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:52,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:52,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:52,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904309820] [2021-10-29 04:55:52,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904309820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:52,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:52,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:52,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670565851] [2021-10-29 04:55:52,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:55:52,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:55:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:52,898 INFO L87 Difference]: Start difference. First operand 242 states and 254 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:53,162 INFO L93 Difference]: Finished difference Result 245 states and 258 transitions. [2021-10-29 04:55:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:53,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:55:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:53,165 INFO L225 Difference]: With dead ends: 245 [2021-10-29 04:55:53,166 INFO L226 Difference]: Without dead ends: 245 [2021-10-29 04:55:53,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:55:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-29 04:55:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2021-10-29 04:55:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 234 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 247 transitions. [2021-10-29 04:55:53,173 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 247 transitions. Word has length 24 [2021-10-29 04:55:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:53,174 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 247 transitions. [2021-10-29 04:55:53,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 247 transitions. [2021-10-29 04:55:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:55:53,175 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:53,176 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:53,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:55:53,176 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 640226692, now seen corresponding path program 1 times [2021-10-29 04:55:53,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:53,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463796246] [2021-10-29 04:55:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:53,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:53,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:53,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463796246] [2021-10-29 04:55:53,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463796246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:53,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:53,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:53,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081913622] [2021-10-29 04:55:53,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:55:53,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:53,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:55:53,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:53,309 INFO L87 Difference]: Start difference. First operand 235 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:53,549 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2021-10-29 04:55:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:53,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:55:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:53,551 INFO L225 Difference]: With dead ends: 238 [2021-10-29 04:55:53,552 INFO L226 Difference]: Without dead ends: 238 [2021-10-29 04:55:53,552 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:55:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-29 04:55:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2021-10-29 04:55:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 144 states have (on average 1.6666666666666667) internal successors, (240), 227 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 240 transitions. [2021-10-29 04:55:53,558 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 240 transitions. Word has length 24 [2021-10-29 04:55:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:53,559 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 240 transitions. [2021-10-29 04:55:53,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 240 transitions. [2021-10-29 04:55:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:55:53,560 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:53,560 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:53,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:55:53,560 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1627808933, now seen corresponding path program 1 times [2021-10-29 04:55:53,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:53,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059641334] [2021-10-29 04:55:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:53,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:53,647 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:53,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059641334] [2021-10-29 04:55:53,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059641334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:53,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:53,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:53,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565567125] [2021-10-29 04:55:53,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:55:53,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:55:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:53,649 INFO L87 Difference]: Start difference. First operand 228 states and 240 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:53,860 INFO L93 Difference]: Finished difference Result 231 states and 244 transitions. [2021-10-29 04:55:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:53,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:55:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:53,862 INFO L225 Difference]: With dead ends: 231 [2021-10-29 04:55:53,862 INFO L226 Difference]: Without dead ends: 231 [2021-10-29 04:55:53,862 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:55:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-29 04:55:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2021-10-29 04:55:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 144 states have (on average 1.6180555555555556) internal successors, (233), 220 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2021-10-29 04:55:53,868 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 25 [2021-10-29 04:55:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:53,868 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2021-10-29 04:55:53,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2021-10-29 04:55:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:55:53,869 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:53,869 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:53,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 04:55:53,870 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1627808932, now seen corresponding path program 1 times [2021-10-29 04:55:53,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:53,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636927852] [2021-10-29 04:55:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:53,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:53,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:53,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636927852] [2021-10-29 04:55:53,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636927852] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:53,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:53,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:55:53,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461197233] [2021-10-29 04:55:53,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:55:53,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:55:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:55:53,970 INFO L87 Difference]: Start difference. First operand 221 states and 233 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:54,187 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2021-10-29 04:55:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:55:54,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:55:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:54,189 INFO L225 Difference]: With dead ends: 224 [2021-10-29 04:55:54,189 INFO L226 Difference]: Without dead ends: 224 [2021-10-29 04:55:54,190 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:55:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-29 04:55:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2021-10-29 04:55:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.5694444444444444) internal successors, (226), 213 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 226 transitions. [2021-10-29 04:55:54,196 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 226 transitions. Word has length 25 [2021-10-29 04:55:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:54,197 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 226 transitions. [2021-10-29 04:55:54,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 226 transitions. [2021-10-29 04:55:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 04:55:54,200 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:54,200 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:54,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 04:55:54,201 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -955589745, now seen corresponding path program 1 times [2021-10-29 04:55:54,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:54,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455571832] [2021-10-29 04:55:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:54,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:54,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:54,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455571832] [2021-10-29 04:55:54,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455571832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:54,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:54,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-29 04:55:54,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932244407] [2021-10-29 04:55:54,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-29 04:55:54,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-29 04:55:54,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-29 04:55:54,931 INFO L87 Difference]: Start difference. First operand 214 states and 226 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:56,966 INFO L93 Difference]: Finished difference Result 406 states and 429 transitions. [2021-10-29 04:55:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-29 04:55:56,967 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-29 04:55:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:56,969 INFO L225 Difference]: With dead ends: 406 [2021-10-29 04:55:56,969 INFO L226 Difference]: Without dead ends: 406 [2021-10-29 04:55:56,973 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-10-29 04:55:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-10-29 04:55:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 226. [2021-10-29 04:55:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 225 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 239 transitions. [2021-10-29 04:55:56,987 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 239 transitions. Word has length 27 [2021-10-29 04:55:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:56,988 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 239 transitions. [2021-10-29 04:55:56,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 239 transitions. [2021-10-29 04:55:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 04:55:56,998 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:56,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:56,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 04:55:56,998 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:56,999 INFO L85 PathProgramCache]: Analyzing trace with hash 801448723, now seen corresponding path program 1 times [2021-10-29 04:55:56,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:57,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711948061] [2021-10-29 04:55:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:57,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:57,505 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:57,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711948061] [2021-10-29 04:55:57,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711948061] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:57,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:57,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-29 04:55:57,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629764835] [2021-10-29 04:55:57,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-29 04:55:57,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:57,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-29 04:55:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-29 04:55:57,507 INFO L87 Difference]: Start difference. First operand 226 states and 239 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:59,239 INFO L93 Difference]: Finished difference Result 488 states and 518 transitions. [2021-10-29 04:55:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-29 04:55:59,240 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 04:55:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:59,242 INFO L225 Difference]: With dead ends: 488 [2021-10-29 04:55:59,242 INFO L226 Difference]: Without dead ends: 488 [2021-10-29 04:55:59,243 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2021-10-29 04:55:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-10-29 04:55:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 268. [2021-10-29 04:55:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 267 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2021-10-29 04:55:59,255 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 29 [2021-10-29 04:55:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:59,256 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2021-10-29 04:55:59,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2021-10-29 04:55:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 04:55:59,257 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:59,257 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:59,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 04:55:59,258 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:55:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash -924887149, now seen corresponding path program 1 times [2021-10-29 04:55:59,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:55:59,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842205004] [2021-10-29 04:55:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:59,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:55:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:55:59,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:55:59,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842205004] [2021-10-29 04:55:59,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842205004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:55:59,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:55:59,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-29 04:55:59,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452554262] [2021-10-29 04:55:59,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-29 04:55:59,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:55:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-29 04:55:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-29 04:55:59,954 INFO L87 Difference]: Start difference. First operand 268 states and 299 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:56:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:56:01,906 INFO L93 Difference]: Finished difference Result 416 states and 455 transitions. [2021-10-29 04:56:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 04:56:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-29 04:56:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:56:01,910 INFO L225 Difference]: With dead ends: 416 [2021-10-29 04:56:01,910 INFO L226 Difference]: Without dead ends: 416 [2021-10-29 04:56:01,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-10-29 04:56:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-10-29 04:56:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 267. [2021-10-29 04:56:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 198 states have (on average 1.5) internal successors, (297), 266 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:56:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2021-10-29 04:56:01,921 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 30 [2021-10-29 04:56:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:56:01,922 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2021-10-29 04:56:01,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:56:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2021-10-29 04:56:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 04:56:01,923 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:56:01,923 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:56:01,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 04:56:01,924 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:56:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:56:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash -924887148, now seen corresponding path program 1 times [2021-10-29 04:56:01,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:56:01,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278624926] [2021-10-29 04:56:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:56:01,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:56:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:56:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:56:02,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:56:02,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278624926] [2021-10-29 04:56:02,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278624926] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:56:02,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:56:02,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 04:56:02,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291044864] [2021-10-29 04:56:02,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-29 04:56:02,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:56:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-29 04:56:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-10-29 04:56:02,729 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:56:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:56:05,292 INFO L93 Difference]: Finished difference Result 445 states and 484 transitions. [2021-10-29 04:56:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-29 04:56:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-29 04:56:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:56:05,295 INFO L225 Difference]: With dead ends: 445 [2021-10-29 04:56:05,295 INFO L226 Difference]: Without dead ends: 445 [2021-10-29 04:56:05,296 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2021-10-29 04:56:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-10-29 04:56:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 271. [2021-10-29 04:56:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 202 states have (on average 1.49009900990099) internal successors, (301), 270 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:56:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2021-10-29 04:56:05,307 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 30 [2021-10-29 04:56:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:56:05,307 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2021-10-29 04:56:05,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:56:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2021-10-29 04:56:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 04:56:05,309 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:56:05,309 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:56:05,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 04:56:05,310 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-10-29 04:56:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:56:05,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1077683325, now seen corresponding path program 1 times [2021-10-29 04:56:05,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:56:05,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81870581] [2021-10-29 04:56:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:56:05,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:56:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:56:05,385 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:56:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:56:05,480 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 04:56:05,480 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 04:56:05,482 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-29 04:56:05,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 04:56:05,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 04:56:05,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-29 04:56:05,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 04:56:05,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 04:56:05,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-29 04:56:05,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 04:56:05,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 04:56:05,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 04:56:05,487 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-29 04:56:05,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-29 04:56:05,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 04:56:05,488 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 04:56:05,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 04:56:05,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 04:56:05,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-29 04:56:05,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 04:56:05,489 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 04:56:05,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-29 04:56:05,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 04:56:05,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-29 04:56:05,490 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 04:56:05,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 04:56:05,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-29 04:56:05,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 04:56:05,491 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-29 04:56:05,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 04:56:05,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 04:56:05,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-29 04:56:05,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-29 04:56:05,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-29 04:56:05,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-29 04:56:05,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-29 04:56:05,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-29 04:56:05,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-29 04:56:05,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-29 04:56:05,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-29 04:56:05,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-29 04:56:05,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-29 04:56:05,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-29 04:56:05,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-29 04:56:05,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-29 04:56:05,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-29 04:56:05,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-29 04:56:05,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-29 04:56:05,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-29 04:56:05,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-29 04:56:05,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-29 04:56:05,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-29 04:56:05,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-29 04:56:05,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-29 04:56:05,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-29 04:56:05,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-29 04:56:05,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-29 04:56:05,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-29 04:56:05,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-29 04:56:05,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-29 04:56:05,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-29 04:56:05,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-29 04:56:05,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-29 04:56:05,500 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-29 04:56:05,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-29 04:56:05,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-29 04:56:05,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-29 04:56:05,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-29 04:56:05,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-29 04:56:05,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-29 04:56:05,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-29 04:56:05,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-29 04:56:05,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-29 04:56:05,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-29 04:56:05,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-29 04:56:05,504 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-29 04:56:05,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-29 04:56:05,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-29 04:56:05,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-29 04:56:05,505 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-29 04:56:05,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-29 04:56:05,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-29 04:56:05,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-29 04:56:05,506 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-29 04:56:05,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-29 04:56:05,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-29 04:56:05,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-29 04:56:05,507 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-29 04:56:05,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-29 04:56:05,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-29 04:56:05,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,508 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-10-29 04:56:05,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-10-29 04:56:05,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-10-29 04:56:05,509 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-29 04:56:05,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-29 04:56:05,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-10-29 04:56:05,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-29 04:56:05,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-29 04:56:05,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-29 04:56:05,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-29 04:56:05,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-29 04:56:05,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-29 04:56:05,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-29 04:56:05,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-29 04:56:05,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-10-29 04:56:05,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-29 04:56:05,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-29 04:56:05,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-10-29 04:56:05,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-10-29 04:56:05,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-10-29 04:56:05,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-10-29 04:56:05,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-10-29 04:56:05,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-10-29 04:56:05,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-10-29 04:56:05,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-10-29 04:56:05,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-10-29 04:56:05,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:56:05,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:56:05,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:56:05,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:56:05,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 04:56:05,522 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:56:05,527 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:56:05,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:56:05 BoogieIcfgContainer [2021-10-29 04:56:05,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:56:05,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:56:05,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:56:05,584 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:56:05,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:55:48" (3/4) ... [2021-10-29 04:56:05,587 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 04:56:05,643 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 04:56:05,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:56:05,645 INFO L168 Benchmark]: Toolchain (without parser) took 20053.03 ms. Allocated memory was 92.3 MB in the beginning and 197.1 MB in the end (delta: 104.9 MB). Free memory was 55.1 MB in the beginning and 135.0 MB in the end (delta: -80.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,649 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 92.3 MB. Free memory is still 72.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:56:05,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.21 ms. Allocated memory was 92.3 MB in the beginning and 113.2 MB in the end (delta: 21.0 MB). Free memory was 54.9 MB in the beginning and 80.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.98 ms. Allocated memory is still 113.2 MB. Free memory was 80.2 MB in the beginning and 76.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,651 INFO L168 Benchmark]: Boogie Preprocessor took 60.65 ms. Allocated memory is still 113.2 MB. Free memory was 76.6 MB in the beginning and 73.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,652 INFO L168 Benchmark]: RCFGBuilder took 1803.26 ms. Allocated memory is still 113.2 MB. Free memory was 73.4 MB in the beginning and 58.1 MB in the end (delta: 15.4 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,652 INFO L168 Benchmark]: TraceAbstraction took 17342.99 ms. Allocated memory was 113.2 MB in the beginning and 197.1 MB in the end (delta: 83.9 MB). Free memory was 58.1 MB in the beginning and 139.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,653 INFO L168 Benchmark]: Witness Printer took 59.43 ms. Allocated memory is still 197.1 MB. Free memory was 139.2 MB in the beginning and 135.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:56:05,656 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 92.3 MB. Free memory is still 72.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 671.21 ms. Allocated memory was 92.3 MB in the beginning and 113.2 MB in the end (delta: 21.0 MB). Free memory was 54.9 MB in the beginning and 80.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.98 ms. Allocated memory is still 113.2 MB. Free memory was 80.2 MB in the beginning and 76.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.65 ms. Allocated memory is still 113.2 MB. Free memory was 76.6 MB in the beginning and 73.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1803.26 ms. Allocated memory is still 113.2 MB. Free memory was 73.4 MB in the beginning and 58.1 MB in the end (delta: 15.4 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17342.99 ms. Allocated memory was 113.2 MB in the beginning and 197.1 MB in the end (delta: 83.9 MB). Free memory was 58.1 MB in the beginning and 139.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. * Witness Printer took 59.43 ms. Allocated memory is still 197.1 MB. Free memory was 139.2 MB in the beginning and 135.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L588] struct node *list = ((void *)0); [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] struct node *list = create_sll(&p1, &p2); [L642] \read(*p1) [L642] \read(*p2) [L626] COND FALSE !(!(beg)) [L627] COND FALSE !(!(end)) [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg [L629] COND TRUE !(beg) [L565] reach_error() - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3046 SDtfs, 5744 SDslu, 9413 SDs, 0 SdLazy, 7941 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 769 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 3934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 04:56:05,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e513ca-bed9-4882-aab5-b5965b3f8239/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...