./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH --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 f533383f211897ea0c402e211f6c19321d99a2ee7c27b850c3f29a2cf1ec1863 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:47:18,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:47:18,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:47:18,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:47:18,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:47:18,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:47:18,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:47:18,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:47:18,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:47:18,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:47:18,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:47:18,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:47:18,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:47:18,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:47:18,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:47:18,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:47:18,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:47:18,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:47:18,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:47:18,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:47:18,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:47:18,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:47:18,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:47:18,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:47:18,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:47:18,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:47:18,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:47:18,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:47:18,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:47:18,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:47:18,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:47:18,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:47:18,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:47:18,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:47:18,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:47:18,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:47:18,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:47:18,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:47:18,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:47:18,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:47:18,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:47:18,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 03:47:18,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:47:18,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:47:18,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:47:18,449 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:47:18,449 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:47:18,450 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:47:18,450 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 03:47:18,450 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:47:18,450 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:47:18,451 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 03:47:18,452 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 03:47:18,452 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:47:18,452 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 03:47:18,453 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 03:47:18,453 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 03:47:18,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:47:18,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:47:18,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:47:18,454 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:47:18,454 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 03:47:18,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:47:18,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:47:18,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:47:18,455 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 03:47:18,455 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 03:47:18,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:47:18,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:47:18,457 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:47:18,458 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:47:18,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:47:18,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:47:18,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:47:18,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:47:18,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:47:18,459 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 03:47:18,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:47:18,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:47:18,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:47:18,460 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_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> f533383f211897ea0c402e211f6c19321d99a2ee7c27b850c3f29a2cf1ec1863 [2021-11-03 03:47:18,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:47:18,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:47:18,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:47:18,745 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:47:18,746 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:47:18,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/list-properties/alternating_list-2.i [2021-11-03 03:47:18,840 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/data/84a63354e/21eeb92dbc9e4c05be4fc9dd25f34f1c/FLAGe199f0515 [2021-11-03 03:47:19,343 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:47:19,343 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/sv-benchmarks/c/list-properties/alternating_list-2.i [2021-11-03 03:47:19,355 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/data/84a63354e/21eeb92dbc9e4c05be4fc9dd25f34f1c/FLAGe199f0515 [2021-11-03 03:47:19,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/data/84a63354e/21eeb92dbc9e4c05be4fc9dd25f34f1c [2021-11-03 03:47:19,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:47:19,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:47:19,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:47:19,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:47:19,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:47:19,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:47:19" (1/1) ... [2021-11-03 03:47:19,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9db214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:19, skipping insertion in model container [2021-11-03 03:47:19,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:47:19" (1/1) ... [2021-11-03 03:47:19,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:47:19,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:47:20,033 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_23aead73-24df-401e-a9aa-ca6fbb940366/sv-benchmarks/c/list-properties/alternating_list-2.i[23574,23587] [2021-11-03 03:47:20,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:47:20,049 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:47:20,116 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_23aead73-24df-401e-a9aa-ca6fbb940366/sv-benchmarks/c/list-properties/alternating_list-2.i[23574,23587] [2021-11-03 03:47:20,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:47:20,162 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:47:20,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20 WrapperNode [2021-11-03 03:47:20,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:47:20,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:47:20,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:47:20,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:47:20,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:47:20,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:47:20,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:47:20,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:47:20,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:47:20,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:47:20,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:47:20,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:47:20,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (1/1) ... [2021-11-03 03:47:20,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:47:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:47:20,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:47:20,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:47:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 03:47:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 03:47:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 03:47:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 03:47:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:47:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 03:47:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:47:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 03:47:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:47:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:47:20,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:47:20,864 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-03 03:47:20,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:20 BoogieIcfgContainer [2021-11-03 03:47:20,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:47:20,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:47:20,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:47:20,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:47:20,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:47:19" (1/3) ... [2021-11-03 03:47:20,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2018f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:20, skipping insertion in model container [2021-11-03 03:47:20,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:20" (2/3) ... [2021-11-03 03:47:20,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2018f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:20, skipping insertion in model container [2021-11-03 03:47:20,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:20" (3/3) ... [2021-11-03 03:47:20,882 INFO L111 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2021-11-03 03:47:20,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:47:20,887 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-11-03 03:47:20,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:47:20,948 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-11-03 03:47:20,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-11-03 03:47:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 2.235294117647059) internal successors, (76), 64 states have internal predecessors, (76), 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-11-03 03:47:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-03 03:47:20,969 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:20,970 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-03 03:47:20,970 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 5348639, now seen corresponding path program 1 times [2021-11-03 03:47:20,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:20,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144022530] [2021-11-03 03:47:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:20,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:21,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:21,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144022530] [2021-11-03 03:47:21,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144022530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:21,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:21,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:47:21,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268414819] [2021-11-03 03:47:21,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 03:47:21,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 03:47:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 03:47:21,146 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 2.235294117647059) internal successors, (76), 64 states have internal predecessors, (76), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 03:47:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:21,161 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2021-11-03 03:47:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 03:47:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2021-11-03 03:47:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:21,170 INFO L225 Difference]: With dead ends: 65 [2021-11-03 03:47:21,171 INFO L226 Difference]: Without dead ends: 62 [2021-11-03 03:47:21,172 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 03:47:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-03 03:47:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-03 03:47:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 2.09375) internal successors, (67), 61 states have internal predecessors, (67), 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-11-03 03:47:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-11-03 03:47:21,205 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 4 [2021-11-03 03:47:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:21,205 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-11-03 03:47:21,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-03 03:47:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-11-03 03:47:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:47:21,207 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:21,207 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:47:21,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 03:47:21,207 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash 165772151, now seen corresponding path program 1 times [2021-11-03 03:47:21,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:21,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716109354] [2021-11-03 03:47:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:21,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:21,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:21,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716109354] [2021-11-03 03:47:21,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716109354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:21,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:21,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:47:21,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580162308] [2021-11-03 03:47:21,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:47:21,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:47:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:47:21,310 INFO L87 Difference]: Start difference. First operand 62 states and 67 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-11-03 03:47:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:21,502 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2021-11-03 03:47:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:47:21,503 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-11-03 03:47:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:21,507 INFO L225 Difference]: With dead ends: 82 [2021-11-03 03:47:21,508 INFO L226 Difference]: Without dead ends: 82 [2021-11-03 03:47:21,508 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-11-03 03:47:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-03 03:47:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2021-11-03 03:47:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.875) internal successors, (75), 62 states have internal predecessors, (75), 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-11-03 03:47:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2021-11-03 03:47:21,517 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 5 [2021-11-03 03:47:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:21,517 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2021-11-03 03:47:21,517 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-11-03 03:47:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2021-11-03 03:47:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:47:21,518 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:21,518 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:47:21,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 03:47:21,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 165772152, now seen corresponding path program 1 times [2021-11-03 03:47:21,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:21,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334678088] [2021-11-03 03:47:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:21,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:21,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:21,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334678088] [2021-11-03 03:47:21,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334678088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:21,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:21,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:47:21,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560116230] [2021-11-03 03:47:21,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:47:21,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:21,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:47:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:47:21,586 INFO L87 Difference]: Start difference. First operand 63 states and 75 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-11-03 03:47:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:21,697 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2021-11-03 03:47:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:47:21,698 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-11-03 03:47:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:21,699 INFO L225 Difference]: With dead ends: 85 [2021-11-03 03:47:21,699 INFO L226 Difference]: Without dead ends: 85 [2021-11-03 03:47:21,699 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-11-03 03:47:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-03 03:47:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2021-11-03 03:47:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 76 states have internal predecessors, (89), 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-11-03 03:47:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2021-11-03 03:47:21,707 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 5 [2021-11-03 03:47:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:21,707 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2021-11-03 03:47:21,708 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-11-03 03:47:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2021-11-03 03:47:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 03:47:21,708 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:21,709 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:21,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 03:47:21,709 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 22544039, now seen corresponding path program 1 times [2021-11-03 03:47:21,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:21,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378188745] [2021-11-03 03:47:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:21,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:21,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:21,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378188745] [2021-11-03 03:47:21,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378188745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:21,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:21,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 03:47:21,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722431967] [2021-11-03 03:47:21,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:47:21,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:47:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:21,774 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-03 03:47:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:21,928 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2021-11-03 03:47:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:47:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-11-03 03:47:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:21,933 INFO L225 Difference]: With dead ends: 97 [2021-11-03 03:47:21,933 INFO L226 Difference]: Without dead ends: 97 [2021-11-03 03:47:21,935 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:47:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-03 03:47:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2021-11-03 03:47:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.625) internal successors, (91), 78 states have internal predecessors, (91), 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-11-03 03:47:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2021-11-03 03:47:21,957 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 11 [2021-11-03 03:47:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:21,958 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2021-11-03 03:47:21,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-03 03:47:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2021-11-03 03:47:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:47:21,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:21,959 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:21,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 03:47:21,960 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 657952496, now seen corresponding path program 1 times [2021-11-03 03:47:21,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:21,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644303583] [2021-11-03 03:47:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:21,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:22,054 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:22,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644303583] [2021-11-03 03:47:22,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644303583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:22,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:22,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:47:22,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258746114] [2021-11-03 03:47:22,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:47:22,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:22,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:47:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:47:22,057 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-03 03:47:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:22,142 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2021-11-03 03:47:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:47:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-11-03 03:47:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:22,146 INFO L225 Difference]: With dead ends: 83 [2021-11-03 03:47:22,146 INFO L226 Difference]: Without dead ends: 83 [2021-11-03 03:47:22,146 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-11-03 03:47:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-03 03:47:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2021-11-03 03:47:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 79 states have internal predecessors, (92), 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-11-03 03:47:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-11-03 03:47:22,162 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 12 [2021-11-03 03:47:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:22,163 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-11-03 03:47:22,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-03 03:47:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-11-03 03:47:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:47:22,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:22,164 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:22,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 03:47:22,165 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 657955027, now seen corresponding path program 1 times [2021-11-03 03:47:22,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:22,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395712698] [2021-11-03 03:47:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:22,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:22,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:22,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395712698] [2021-11-03 03:47:22,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395712698] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:22,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:22,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:47:22,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175465491] [2021-11-03 03:47:22,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:47:22,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:22,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:47:22,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:22,272 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-03 03:47:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:22,374 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2021-11-03 03:47:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:47:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-11-03 03:47:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:22,376 INFO L225 Difference]: With dead ends: 87 [2021-11-03 03:47:22,377 INFO L226 Difference]: Without dead ends: 87 [2021-11-03 03:47:22,377 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:47:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-03 03:47:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2021-11-03 03:47:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.603448275862069) internal successors, (93), 80 states have internal predecessors, (93), 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-11-03 03:47:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2021-11-03 03:47:22,397 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 12 [2021-11-03 03:47:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:22,397 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2021-11-03 03:47:22,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-03 03:47:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2021-11-03 03:47:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:47:22,399 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:22,399 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:22,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 03:47:22,400 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1078230495, now seen corresponding path program 1 times [2021-11-03 03:47:22,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:22,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581641756] [2021-11-03 03:47:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:22,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:22,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:22,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581641756] [2021-11-03 03:47:22,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581641756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:22,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:22,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 03:47:22,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041802321] [2021-11-03 03:47:22,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 03:47:22,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 03:47:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:47:22,517 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-11-03 03:47:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:22,676 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2021-11-03 03:47:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:47:22,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2021-11-03 03:47:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:22,678 INFO L225 Difference]: With dead ends: 95 [2021-11-03 03:47:22,678 INFO L226 Difference]: Without dead ends: 95 [2021-11-03 03:47:22,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:47:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-03 03:47:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-11-03 03:47:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 83 states have internal predecessors, (96), 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-11-03 03:47:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-11-03 03:47:22,683 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 13 [2021-11-03 03:47:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:22,683 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-11-03 03:47:22,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-11-03 03:47:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-11-03 03:47:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:47:22,684 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:22,684 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:22,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 03:47:22,685 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1383915371, now seen corresponding path program 1 times [2021-11-03 03:47:22,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:22,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948605939] [2021-11-03 03:47:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:22,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:22,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:22,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948605939] [2021-11-03 03:47:22,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948605939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:22,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:22,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:47:22,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567801478] [2021-11-03 03:47:22,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:47:22,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:22,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:47:22,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:22,731 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-03 03:47:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:22,852 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2021-11-03 03:47:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:47:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2021-11-03 03:47:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:22,854 INFO L225 Difference]: With dead ends: 88 [2021-11-03 03:47:22,854 INFO L226 Difference]: Without dead ends: 88 [2021-11-03 03:47:22,854 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:47:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-03 03:47:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-11-03 03:47:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 80 states have internal predecessors, (93), 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-11-03 03:47:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2021-11-03 03:47:22,858 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 13 [2021-11-03 03:47:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:22,858 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2021-11-03 03:47:22,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-03 03:47:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2021-11-03 03:47:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:47:22,859 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:22,860 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:22,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 03:47:22,860 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1383915370, now seen corresponding path program 1 times [2021-11-03 03:47:22,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:22,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184383753] [2021-11-03 03:47:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:22,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:22,923 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:22,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184383753] [2021-11-03 03:47:22,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184383753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:22,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:22,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:47:22,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285717533] [2021-11-03 03:47:22,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:47:22,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:47:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:22,925 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-03 03:47:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:23,062 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-11-03 03:47:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:47:23,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2021-11-03 03:47:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:23,063 INFO L225 Difference]: With dead ends: 81 [2021-11-03 03:47:23,063 INFO L226 Difference]: Without dead ends: 81 [2021-11-03 03:47:23,068 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:47:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-03 03:47:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2021-11-03 03:47:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 68 states have internal predecessors, (80), 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-11-03 03:47:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-11-03 03:47:23,073 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 13 [2021-11-03 03:47:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:23,073 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-11-03 03:47:23,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-03 03:47:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2021-11-03 03:47:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 03:47:23,075 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:23,075 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:23,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 03:47:23,076 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 932161238, now seen corresponding path program 1 times [2021-11-03 03:47:23,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:23,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099741158] [2021-11-03 03:47:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:23,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:23,210 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:23,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099741158] [2021-11-03 03:47:23,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099741158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:23,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:47:23,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:47:23,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197847849] [2021-11-03 03:47:23,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:47:23,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:47:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:23,213 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-03 03:47:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:23,332 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-11-03 03:47:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:47:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-03 03:47:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:23,333 INFO L225 Difference]: With dead ends: 77 [2021-11-03 03:47:23,333 INFO L226 Difference]: Without dead ends: 67 [2021-11-03 03:47:23,333 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:47:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-03 03:47:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2021-11-03 03:47:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 62 states have internal predecessors, (73), 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-11-03 03:47:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2021-11-03 03:47:23,336 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 14 [2021-11-03 03:47:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:23,336 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-11-03 03:47:23,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-03 03:47:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2021-11-03 03:47:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 03:47:23,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:23,338 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:23,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 03:47:23,339 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1063572805, now seen corresponding path program 1 times [2021-11-03 03:47:23,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:23,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467305300] [2021-11-03 03:47:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:23,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:23,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:47:23,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467305300] [2021-11-03 03:47:23,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467305300] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 03:47:23,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879756209] [2021-11-03 03:47:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:23,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 03:47:23,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:47:23,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 03:47:23,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 03:47:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:23,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 03:47:23,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:47:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 03:47:23,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:47:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 03:47:23,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879756209] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:47:23,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-03 03:47:23,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2021-11-03 03:47:23,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583422938] [2021-11-03 03:47:23,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:47:23,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:47:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:47:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:23,691 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-03 03:47:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:23,715 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2021-11-03 03:47:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:47:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2021-11-03 03:47:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:23,716 INFO L225 Difference]: With dead ends: 105 [2021-11-03 03:47:23,716 INFO L226 Difference]: Without dead ends: 105 [2021-11-03 03:47:23,717 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:47:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-03 03:47:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2021-11-03 03:47:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 71 states have internal predecessors, (85), 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-11-03 03:47:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2021-11-03 03:47:23,719 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 19 [2021-11-03 03:47:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:23,720 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2021-11-03 03:47:23,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11-03 03:47:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2021-11-03 03:47:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 03:47:23,721 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:23,721 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:23,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 03:47:23,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-03 03:47:23,949 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2021-11-03 03:47:23,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1063264975, now seen corresponding path program 1 times [2021-11-03 03:47:23,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:47:23,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045081301] [2021-11-03 03:47:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:23,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:47:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:47:23,964 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 03:47:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:47:24,015 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 03:47:24,015 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 03:47:24,016 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:47:24,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 03:47:24,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 03:47:24,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 03:47:24,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 03:47:24,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 03:47:24,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 03:47:24,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 03:47:24,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 03:47:24,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 03:47:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 03:47:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-03 03:47:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 03:47:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 03:47:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 03:47:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 03:47:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 03:47:24,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:47:24,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:47:24,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:47:24,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:47:24,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:47:24,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:47:24,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:47:24,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 03:47:24,026 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:24,030 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 03:47:24,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:47:24 BoogieIcfgContainer [2021-11-03 03:47:24,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 03:47:24,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 03:47:24,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 03:47:24,073 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 03:47:24,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:20" (3/4) ... [2021-11-03 03:47:24,075 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 03:47:24,113 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 03:47:24,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 03:47:24,114 INFO L168 Benchmark]: Toolchain (without parser) took 4443.57 ms. Allocated memory was 123.7 MB in the beginning and 161.5 MB in the end (delta: 37.7 MB). Free memory was 83.8 MB in the beginning and 118.1 MB in the end (delta: -34.2 MB). Peak memory consumption was 2.0 MB. Max. memory is 16.1 GB. [2021-11-03 03:47:24,115 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 123.7 MB. Free memory was 101.7 MB in the beginning and 101.6 MB in the end (delta: 119.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:47:24,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.61 ms. Allocated memory is still 123.7 MB. Free memory was 83.6 MB in the beginning and 89.3 MB in the end (delta: -5.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 03:47:24,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 123.7 MB. Free memory was 89.3 MB in the beginning and 87.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:47:24,116 INFO L168 Benchmark]: Boogie Preprocessor took 38.16 ms. Allocated memory is still 123.7 MB. Free memory was 87.7 MB in the beginning and 86.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:47:24,117 INFO L168 Benchmark]: RCFGBuilder took 596.61 ms. Allocated memory is still 123.7 MB. Free memory was 86.2 MB in the beginning and 68.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-03 03:47:24,117 INFO L168 Benchmark]: TraceAbstraction took 3202.44 ms. Allocated memory was 123.7 MB in the beginning and 161.5 MB in the end (delta: 37.7 MB). Free memory was 68.2 MB in the beginning and 120.2 MB in the end (delta: -52.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:47:24,117 INFO L168 Benchmark]: Witness Printer took 40.25 ms. Allocated memory is still 161.5 MB. Free memory was 120.2 MB in the beginning and 118.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:47:24,119 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.21 ms. Allocated memory is still 123.7 MB. Free memory was 101.7 MB in the beginning and 101.6 MB in the end (delta: 119.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 489.61 ms. Allocated memory is still 123.7 MB. Free memory was 83.6 MB in the beginning and 89.3 MB in the end (delta: -5.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.55 ms. Allocated memory is still 123.7 MB. Free memory was 89.3 MB in the beginning and 87.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.16 ms. Allocated memory is still 123.7 MB. Free memory was 87.7 MB in the beginning and 86.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 596.61 ms. Allocated memory is still 123.7 MB. Free memory was 86.2 MB in the beginning and 68.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3202.44 ms. Allocated memory was 123.7 MB in the beginning and 161.5 MB in the end (delta: 37.7 MB). Free memory was 68.2 MB in the beginning and 120.2 MB in the end (delta: -52.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 40.25 ms. Allocated memory is still 161.5 MB. Free memory was 120.2 MB in the beginning and 118.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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: 573]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L532] int flag = 1; [L533] List a = (List) malloc(sizeof(struct node)); [L534] COND FALSE !(a == 0) [L535] List t; [L536] List p = a; [L537] COND TRUE __VERIFIER_nondet_int() [L538] COND TRUE \read(flag) [L539] p->h = 2 [L540] flag = 0 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L537] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a [L552] flag = 1 [L553] EXPR p->h [L553] COND TRUE p->h != 3 [L554] COND TRUE \read(flag) [L555] flag = 0 [L556] EXPR p->h [L556] COND TRUE p->h != 1 [L573] reach_error() - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: 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, 65 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 498 SDtfs, 717 SDslu, 585 SDs, 0 SdLazy, 777 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 121 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 8/10 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-11-03 03:47:24,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23aead73-24df-401e-a9aa-ca6fbb940366/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)