./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b8a3c71378af91196ed2f84e64deb923f93cbb4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 08:47:54,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:47:54,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:47:54,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:47:54,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:47:54,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:47:54,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:47:54,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:47:54,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:47:54,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:47:54,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:47:54,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:47:54,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:47:54,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:47:54,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:47:54,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:47:54,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:47:54,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:47:54,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:47:54,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:47:54,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:47:54,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:47:54,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:47:54,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:47:54,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:47:54,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:47:54,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:47:54,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:47:54,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:47:54,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:47:54,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:47:54,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:47:54,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:47:54,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:47:54,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:47:54,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:47:54,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:47:54,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:47:54,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:47:54,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:47:54,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:47:54,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 08:47:54,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:47:54,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:47:54,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:47:54,265 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:47:54,265 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:47:54,265 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:47:54,265 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:47:54,266 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 08:47:54,266 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 08:47:54,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 08:47:54,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 08:47:54,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:47:54,267 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:47:54,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:47:54,268 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:47:54,269 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:47:54,269 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:47:54,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:47:54,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:47:54,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:47:54,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:47:54,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:47:54,270 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 08:47:54,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 08:47:54,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:47:54,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:47:54,270 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-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/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-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5b8a3c71378af91196ed2f84e64deb923f93cbb4 [2020-12-09 08:47:54,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:47:54,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:47:54,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:47:54,458 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:47:54,459 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:47:54,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2020-12-09 08:47:54,503 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/data/4a8bb8380/95d7cdfd093b4efd8d50709953a5f99e/FLAG47d33185d [2020-12-09 08:47:54,910 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:47:54,911 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/sv-benchmarks/c/list-simple/sll2c_update_all.i [2020-12-09 08:47:54,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/data/4a8bb8380/95d7cdfd093b4efd8d50709953a5f99e/FLAG47d33185d [2020-12-09 08:47:54,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/data/4a8bb8380/95d7cdfd093b4efd8d50709953a5f99e [2020-12-09 08:47:54,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:47:54,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:47:54,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:47:54,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:47:54,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:47:54,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:47:54" (1/1) ... [2020-12-09 08:47:54,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c578e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:54, skipping insertion in model container [2020-12-09 08:47:54,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:47:54" (1/1) ... [2020-12-09 08:47:54,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:47:54,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:47:55,181 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2020-12-09 08:47:55,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:47:55,192 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:47:55,230 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2020-12-09 08:47:55,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:47:55,271 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:47:55,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55 WrapperNode [2020-12-09 08:47:55,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:47:55,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:47:55,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:47:55,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:47:55,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:47:55,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:47:55,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:47:55,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:47:55,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... [2020-12-09 08:47:55,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:47:55,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:47:55,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:47:55,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:47:55,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:47:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 08:47:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 08:47:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 08:47:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 08:47:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:47:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 08:47:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 08:47:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 08:47:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:47:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:47:55,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:47:55,845 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-09 08:47:55,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:47:55 BoogieIcfgContainer [2020-12-09 08:47:55,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:47:55,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:47:55,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:47:55,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:47:55,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:47:54" (1/3) ... [2020-12-09 08:47:55,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142efc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:47:55, skipping insertion in model container [2020-12-09 08:47:55,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:47:55" (2/3) ... [2020-12-09 08:47:55,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142efc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:47:55, skipping insertion in model container [2020-12-09 08:47:55,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:47:55" (3/3) ... [2020-12-09 08:47:55,854 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2020-12-09 08:47:55,867 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:47:55,870 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2020-12-09 08:47:55,877 INFO L253 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2020-12-09 08:47:55,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:47:55,891 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 08:47:55,891 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:47:55,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:47:55,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:47:55,892 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:47:55,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:47:55,892 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:47:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2020-12-09 08:47:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 08:47:55,908 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:55,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 08:47:55,908 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 212640, now seen corresponding path program 1 times [2020-12-09 08:47:55,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:55,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341517530] [2020-12-09 08:47:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:56,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341517530] [2020-12-09 08:47:56,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 08:47:56,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390239150] [2020-12-09 08:47:56,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:47:56,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:47:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:47:56,044 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2020-12-09 08:47:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,120 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2020-12-09 08:47:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:47:56,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 08:47:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,130 INFO L225 Difference]: With dead ends: 83 [2020-12-09 08:47:56,130 INFO L226 Difference]: Without dead ends: 79 [2020-12-09 08:47:56,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:47:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-09 08:47:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2020-12-09 08:47:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 08:47:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2020-12-09 08:47:56,165 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 3 [2020-12-09 08:47:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,165 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2020-12-09 08:47:56,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:47:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2020-12-09 08:47:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 08:47:56,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 08:47:56,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 08:47:56,166 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash 212641, now seen corresponding path program 1 times [2020-12-09 08:47:56,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802242866] [2020-12-09 08:47:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:56,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802242866] [2020-12-09 08:47:56,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 08:47:56,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927813460] [2020-12-09 08:47:56,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:47:56,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:47:56,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:47:56,227 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 3 states. [2020-12-09 08:47:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,268 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-12-09 08:47:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:47:56,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 08:47:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,269 INFO L225 Difference]: With dead ends: 56 [2020-12-09 08:47:56,269 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 08:47:56,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:47:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 08:47:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-12-09 08:47:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 08:47:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-12-09 08:47:56,274 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 3 [2020-12-09 08:47:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,274 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-12-09 08:47:56,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:47:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-12-09 08:47:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 08:47:56,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 08:47:56,275 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2039955730, now seen corresponding path program 1 times [2020-12-09 08:47:56,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716367653] [2020-12-09 08:47:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:56,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716367653] [2020-12-09 08:47:56,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:47:56,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516860742] [2020-12-09 08:47:56,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:47:56,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:47:56,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:47:56,324 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 3 states. [2020-12-09 08:47:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,335 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2020-12-09 08:47:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:47:56,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-12-09 08:47:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,337 INFO L225 Difference]: With dead ends: 63 [2020-12-09 08:47:56,337 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 08:47:56,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:47:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 08:47:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2020-12-09 08:47:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 08:47:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2020-12-09 08:47:56,343 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 6 [2020-12-09 08:47:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,343 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2020-12-09 08:47:56,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:47:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2020-12-09 08:47:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 08:47:56,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 08:47:56,344 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1625458258, now seen corresponding path program 1 times [2020-12-09 08:47:56,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597924179] [2020-12-09 08:47:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:56,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597924179] [2020-12-09 08:47:56,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:47:56,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516285729] [2020-12-09 08:47:56,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:47:56,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:47:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:47:56,403 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2020-12-09 08:47:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,486 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2020-12-09 08:47:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:47:56,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 08:47:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,488 INFO L225 Difference]: With dead ends: 78 [2020-12-09 08:47:56,488 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 08:47:56,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:47:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 08:47:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2020-12-09 08:47:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 08:47:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-12-09 08:47:56,493 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 9 [2020-12-09 08:47:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,494 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-12-09 08:47:56,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:47:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-12-09 08:47:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 08:47:56,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 08:47:56,494 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1625458257, now seen corresponding path program 1 times [2020-12-09 08:47:56,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242717962] [2020-12-09 08:47:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:56,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242717962] [2020-12-09 08:47:56,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:47:56,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791685235] [2020-12-09 08:47:56,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:47:56,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:47:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:47:56,549 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 4 states. [2020-12-09 08:47:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,599 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2020-12-09 08:47:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:47:56,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 08:47:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,600 INFO L225 Difference]: With dead ends: 58 [2020-12-09 08:47:56,600 INFO L226 Difference]: Without dead ends: 58 [2020-12-09 08:47:56,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:47:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-12-09 08:47:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-12-09 08:47:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 08:47:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2020-12-09 08:47:56,605 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 9 [2020-12-09 08:47:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,606 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2020-12-09 08:47:56,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:47:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-12-09 08:47:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 08:47:56,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 08:47:56,607 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1302851528, now seen corresponding path program 1 times [2020-12-09 08:47:56,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334042610] [2020-12-09 08:47:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:56,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334042610] [2020-12-09 08:47:56,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:47:56,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071349001] [2020-12-09 08:47:56,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 08:47:56,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 08:47:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 08:47:56,682 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 6 states. [2020-12-09 08:47:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,742 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-12-09 08:47:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:47:56,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 08:47:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,743 INFO L225 Difference]: With dead ends: 73 [2020-12-09 08:47:56,743 INFO L226 Difference]: Without dead ends: 73 [2020-12-09 08:47:56,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:47:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-09 08:47:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2020-12-09 08:47:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-09 08:47:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-12-09 08:47:56,746 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 11 [2020-12-09 08:47:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,746 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-12-09 08:47:56,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 08:47:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-12-09 08:47:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 08:47:56,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 08:47:56,747 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1302851529, now seen corresponding path program 1 times [2020-12-09 08:47:56,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845221976] [2020-12-09 08:47:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:56,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845221976] [2020-12-09 08:47:56,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:47:56,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93899730] [2020-12-09 08:47:56,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:47:56,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:47:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:47:56,786 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2020-12-09 08:47:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,822 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2020-12-09 08:47:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:47:56,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 08:47:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,823 INFO L225 Difference]: With dead ends: 53 [2020-12-09 08:47:56,823 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 08:47:56,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:47:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 08:47:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-09 08:47:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 08:47:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2020-12-09 08:47:56,826 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 11 [2020-12-09 08:47:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,826 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2020-12-09 08:47:56,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:47:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2020-12-09 08:47:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 08:47:56,826 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 08:47:56,827 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -365255498, now seen corresponding path program 1 times [2020-12-09 08:47:56,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71663395] [2020-12-09 08:47:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:56,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71663395] [2020-12-09 08:47:56,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:56,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:47:56,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722672742] [2020-12-09 08:47:56,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:47:56,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:47:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:47:56,858 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2020-12-09 08:47:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:56,944 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2020-12-09 08:47:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:47:56,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-09 08:47:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:56,945 INFO L225 Difference]: With dead ends: 112 [2020-12-09 08:47:56,945 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 08:47:56,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:47:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 08:47:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2020-12-09 08:47:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 08:47:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-12-09 08:47:56,948 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 14 [2020-12-09 08:47:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:56,949 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-12-09 08:47:56,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:47:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-12-09 08:47:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 08:47:56,949 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:56,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:56,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 08:47:56,949 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:56,950 INFO L82 PathProgramCache]: Analyzing trace with hash -365255497, now seen corresponding path program 1 times [2020-12-09 08:47:56,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:56,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136039290] [2020-12-09 08:47:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:47:57,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136039290] [2020-12-09 08:47:57,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:57,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 08:47:57,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103096034] [2020-12-09 08:47:57,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:47:57,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:47:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:47:57,012 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 7 states. [2020-12-09 08:47:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:57,157 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2020-12-09 08:47:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 08:47:57,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 08:47:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:57,158 INFO L225 Difference]: With dead ends: 94 [2020-12-09 08:47:57,158 INFO L226 Difference]: Without dead ends: 94 [2020-12-09 08:47:57,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:47:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-09 08:47:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2020-12-09 08:47:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 08:47:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-12-09 08:47:57,161 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 14 [2020-12-09 08:47:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:57,161 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-12-09 08:47:57,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:47:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-12-09 08:47:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 08:47:57,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:57,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:57,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 08:47:57,162 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1566060825, now seen corresponding path program 1 times [2020-12-09 08:47:57,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:57,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882890382] [2020-12-09 08:47:57,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:57,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882890382] [2020-12-09 08:47:57,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:57,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:47:57,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343154366] [2020-12-09 08:47:57,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:47:57,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:47:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:47:57,190 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2020-12-09 08:47:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:57,206 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2020-12-09 08:47:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:47:57,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 08:47:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:57,207 INFO L225 Difference]: With dead ends: 78 [2020-12-09 08:47:57,208 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 08:47:57,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:47:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 08:47:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2020-12-09 08:47:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 08:47:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2020-12-09 08:47:57,211 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 15 [2020-12-09 08:47:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:57,211 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2020-12-09 08:47:57,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:47:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2020-12-09 08:47:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 08:47:57,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:57,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:57,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 08:47:57,212 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:57,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:57,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1173203470, now seen corresponding path program 1 times [2020-12-09 08:47:57,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:57,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731858768] [2020-12-09 08:47:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:57,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731858768] [2020-12-09 08:47:57,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:57,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:47:57,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87013775] [2020-12-09 08:47:57,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:47:57,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:57,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:47:57,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:47:57,237 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 4 states. [2020-12-09 08:47:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:57,262 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-12-09 08:47:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:47:57,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 08:47:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:57,263 INFO L225 Difference]: With dead ends: 116 [2020-12-09 08:47:57,264 INFO L226 Difference]: Without dead ends: 116 [2020-12-09 08:47:57,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:47:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-09 08:47:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 59. [2020-12-09 08:47:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 08:47:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-12-09 08:47:57,267 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 16 [2020-12-09 08:47:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:57,267 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-12-09 08:47:57,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:47:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-12-09 08:47:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 08:47:57,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:57,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:57,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 08:47:57,269 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1416839649, now seen corresponding path program 1 times [2020-12-09 08:47:57,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:57,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219386662] [2020-12-09 08:47:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:57,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219386662] [2020-12-09 08:47:57,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:47:57,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:47:57,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500811526] [2020-12-09 08:47:57,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:47:57,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:47:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:47:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:47:57,312 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2020-12-09 08:47:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:47:57,381 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2020-12-09 08:47:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:47:57,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-09 08:47:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:47:57,382 INFO L225 Difference]: With dead ends: 83 [2020-12-09 08:47:57,382 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 08:47:57,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:47:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 08:47:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 62. [2020-12-09 08:47:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 08:47:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2020-12-09 08:47:57,386 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 18 [2020-12-09 08:47:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:47:57,386 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2020-12-09 08:47:57,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:47:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2020-12-09 08:47:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 08:47:57,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:47:57,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:47:57,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 08:47:57,387 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:47:57,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:47:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1416839650, now seen corresponding path program 1 times [2020-12-09 08:47:57,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:47:57,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008065621] [2020-12-09 08:47:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:47:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:57,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008065621] [2020-12-09 08:47:57,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891173313] [2020-12-09 08:47:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:47:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:47:57,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 08:47:57,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:47:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:57,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:47:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:47:57,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1241227174] [2020-12-09 08:47:57,658 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 08:47:57,658 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:47:57,662 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:47:57,668 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:47:57,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:47:57,804 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:58,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:58,478 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:58,504 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:59,139 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:59,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:59,889 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:47:59,951 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 08:48:00,103 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-12-09 08:48:00,273 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2020-12-09 08:48:01,140 WARN L197 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 136 [2020-12-09 08:48:01,436 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2020-12-09 08:48:01,736 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-12-09 08:48:02,072 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 124 [2020-12-09 08:48:02,692 WARN L197 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 124 [2020-12-09 08:48:04,222 WARN L197 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 234 DAG size of output: 163 [2020-12-09 08:48:05,728 WARN L197 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 233 DAG size of output: 160 [2020-12-09 08:48:06,847 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 234 DAG size of output: 156 [2020-12-09 08:48:06,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:48:06,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 4, 4] total 19 [2020-12-09 08:48:06,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020163640] [2020-12-09 08:48:06,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 08:48:06,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:48:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 08:48:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2020-12-09 08:48:06,851 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 12 states. [2020-12-09 08:48:07,197 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2020-12-09 08:48:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:48:07,723 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-12-09 08:48:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 08:48:07,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-12-09 08:48:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:48:07,725 INFO L225 Difference]: With dead ends: 66 [2020-12-09 08:48:07,725 INFO L226 Difference]: Without dead ends: 66 [2020-12-09 08:48:07,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2020-12-09 08:48:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-09 08:48:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2020-12-09 08:48:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 08:48:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2020-12-09 08:48:07,728 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 18 [2020-12-09 08:48:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:48:07,728 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-12-09 08:48:07,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 08:48:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2020-12-09 08:48:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 08:48:07,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:48:07,729 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:48:07,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 08:48:07,931 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:48:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:48:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 842314310, now seen corresponding path program 1 times [2020-12-09 08:48:07,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:48:07,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317667164] [2020-12-09 08:48:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:48:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:48:08,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317667164] [2020-12-09 08:48:08,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934289663] [2020-12-09 08:48:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:48:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:08,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 50 conjunts are in the unsatisfiable core [2020-12-09 08:48:08,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:48:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:48:09,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:48:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:48:12,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [628291517] [2020-12-09 08:48:12,798 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 08:48:12,798 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:48:12,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:48:12,798 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:48:12,799 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:48:12,854 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:13,010 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:13,206 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:13,235 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:13,636 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:14,003 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:14,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:14,032 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:15,069 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:48:15,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:48:15,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2020-12-09 08:48:15,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558794185] [2020-12-09 08:48:15,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-09 08:48:15,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:48:15,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-09 08:48:15,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=655, Unknown=1, NotChecked=0, Total=756 [2020-12-09 08:48:15,071 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 28 states. [2020-12-09 08:48:15,560 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2020-12-09 08:48:19,740 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2020-12-09 08:48:22,799 WARN L197 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-12-09 08:48:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:48:23,507 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2020-12-09 08:48:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 08:48:23,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 19 [2020-12-09 08:48:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:48:23,509 INFO L225 Difference]: With dead ends: 251 [2020-12-09 08:48:23,509 INFO L226 Difference]: Without dead ends: 251 [2020-12-09 08:48:23,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=373, Invalid=1518, Unknown=1, NotChecked=0, Total=1892 [2020-12-09 08:48:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-09 08:48:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 75. [2020-12-09 08:48:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 08:48:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-12-09 08:48:23,514 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 19 [2020-12-09 08:48:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:48:23,515 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-12-09 08:48:23,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-09 08:48:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-12-09 08:48:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 08:48:23,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:48:23,516 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:48:23,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2020-12-09 08:48:23,717 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:48:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:48:23,718 INFO L82 PathProgramCache]: Analyzing trace with hash 842314311, now seen corresponding path program 1 times [2020-12-09 08:48:23,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:48:23,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900630709] [2020-12-09 08:48:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:48:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:48:23,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900630709] [2020-12-09 08:48:23,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481069250] [2020-12-09 08:48:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:48:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:23,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 62 conjunts are in the unsatisfiable core [2020-12-09 08:48:23,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:48:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:48:24,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:48:25,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_5 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 c_ULTIMATE.start_main_~s~0.offset) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) c_ULTIMATE.start_main_~s~0.offset) 4)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (let ((.cse0 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse0 v_DerPreprocessor_4) c_ULTIMATE.start_main_~s~0.offset) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse0 v_DerPreprocessor_2) c_ULTIMATE.start_main_~s~0.offset)))) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2020-12-09 08:48:27,259 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_5 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 4)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (forall ((v_prenex_7 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (v_prenex_8 Int)) (or (let ((.cse0 (+ v_prenex_8 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse0 v_DerPreprocessor_4) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse0 v_DerPreprocessor_2) c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (< v_prenex_8 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) is different from false [2020-12-09 08:48:27,933 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-12-09 08:48:28,544 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-12-09 08:48:29,022 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-12-09 08:48:29,082 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_5 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int) (|v_ULTIMATE.start_node_create_#t~malloc5.base_14| Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 v_ULTIMATE.start_sll_circular_create_~head~0.offset_28) (<= 0 (+ (select (store (select (let ((.cse0 (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_14| (store (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 c_ULTIMATE.start_node_create_~temp~0.offset)))) (store .cse0 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse0 c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_ULTIMATE.start_sll_circular_create_~head~0.offset_28))) |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28) 4)) (< 0 (select |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_14|)))) (forall ((|#length| (Array Int Int))) (< (select |#length| c_ULTIMATE.start_node_create_~temp~0.base) (+ c_ULTIMATE.start_node_create_~temp~0.offset 8)))) (forall ((v_prenex_7 Int) (|#length| (Array Int Int)) (v_prenex_11 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_prenex_10 Int) (v_DerPreprocessor_4 Int) (v_prenex_9 (Array Int (Array Int Int))) (v_DerPreprocessor_2 Int) (v_prenex_8 Int)) (or (< v_prenex_8 v_prenex_10) (let ((.cse2 (+ v_prenex_8 4))) (<= (+ (select (store (select (let ((.cse1 (store v_prenex_9 v_prenex_11 (store (select v_prenex_9 v_prenex_11) v_prenex_10 c_ULTIMATE.start_node_create_~temp~0.offset)))) (store .cse1 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse1 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_7 v_prenex_10))) v_prenex_11) .cse2 v_DerPreprocessor_4) v_prenex_10) 8) (select (store |#length| v_prenex_11 8) (select (store (select (let ((.cse3 (store |#memory_$Pointer$.base| v_prenex_11 (store (select |#memory_$Pointer$.base| v_prenex_11) v_prenex_10 c_ULTIMATE.start_node_create_~temp~0.base)))) (store .cse3 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse3 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_7 v_prenex_11))) v_prenex_11) .cse2 v_DerPreprocessor_2) v_prenex_10)))) (< 0 (select |c_#valid| v_prenex_11)) (< (select |#length| c_ULTIMATE.start_node_create_~temp~0.base) (+ c_ULTIMATE.start_node_create_~temp~0.offset 8))))) is different from false [2020-12-09 08:48:29,122 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:48:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 08:48:29,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1644895793] [2020-12-09 08:48:29,133 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 08:48:29,133 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:48:29,133 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:48:29,133 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:48:29,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:48:29,199 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:29,359 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:29,566 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:29,582 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:30,046 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:30,374 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:30,423 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:30,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:31,489 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:48:31,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:48:31,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 32 [2020-12-09 08:48:31,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919850781] [2020-12-09 08:48:31,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 08:48:31,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:48:31,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 08:48:31,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=788, Unknown=8, NotChecked=174, Total=1056 [2020-12-09 08:48:31,492 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 33 states. [2020-12-09 08:48:36,588 WARN L197 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 203 DAG size of output: 119 [2020-12-09 08:48:38,730 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (let ((.cse3 (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse2 (select |c_#length| .cse21)) (.cse10 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (.cse11 (select |c_#length| c_ULTIMATE.start_sll_circular_create_~last~0.base)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (and (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_5 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 Int) (|v_ULTIMATE.start_node_create_#t~malloc5.base_14| Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 v_ULTIMATE.start_sll_circular_create_~head~0.offset_28) (<= 0 (+ (select (store (select (let ((.cse0 (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_14| (store (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse0 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse0 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_ULTIMATE.start_sll_circular_create_~head~0.offset_28))) |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28) 4)) (< 0 (select |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_14|)))) (<= (+ .cse1 8) .cse2) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (let ((.cse4 (<= 0 c_ULTIMATE.start_node_create_~temp~0.offset)) (.cse5 (select |c_#valid| 0))) (or (and .cse3 .cse4 (= .cse5 1)) (and .cse3 .cse4 (= .cse5 0)))) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) .cse3 (forall ((v_prenex_7 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_prenex_10 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (v_prenex_9 (Array Int (Array Int Int))) (v_prenex_8 Int)) (or (< v_prenex_8 v_prenex_10) (let ((.cse7 (+ v_prenex_8 4))) (<= (+ (select (store (select (let ((.cse6 (store v_prenex_9 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_9 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_10 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse6 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse6 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 v_prenex_10))) c_ULTIMATE.start_node_create_~temp~0.base) .cse7 v_DerPreprocessor_4) v_prenex_10) 8) (select |c_#length| (select (store (select (let ((.cse8 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_10 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse8 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse8 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 c_ULTIMATE.start_node_create_~temp~0.base))) c_ULTIMATE.start_node_create_~temp~0.base) .cse7 v_DerPreprocessor_2) v_prenex_10)))))) (forall ((v_DerPreprocessor_5 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 c_ULTIMATE.start_main_~s~0.offset) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) c_ULTIMATE.start_main_~s~0.offset) 4)))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (let ((.cse9 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse9 v_DerPreprocessor_4) c_ULTIMATE.start_main_~s~0.offset) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse9 v_DerPreprocessor_2) c_ULTIMATE.start_main_~s~0.offset)))) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 c_ULTIMATE.start_main_~s~0.offset))) (= 8 .cse2) (<= (+ .cse10 8) .cse11) (= 8 (select |c_#length| c_ULTIMATE.start_node_create_~temp~0.base)) (<= 0 .cse10) (= (select |c_#length| c_ULTIMATE.start_main_~s~0.base) 8) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 0) (<= 0 .cse1) (= (select |c_#length| c_ULTIMATE.start_sll_circular_create_~head~0.base) 8) (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_5 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (<= 0 (+ (select (store (select (let ((.cse12 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse12 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse12 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_ULTIMATE.start_sll_circular_create_~head~0.offset_28))) c_ULTIMATE.start_node_create_~temp~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28) 4)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 v_ULTIMATE.start_sll_circular_create_~head~0.offset_28))) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (and (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| .cse13) ULTIMATE.start_sll_circular_create_~last~0.offset)) (= (select (select |c_#memory_$Pointer$.offset| .cse13) ULTIMATE.start_sll_circular_create_~last~0.offset) c_ULTIMATE.start_main_~s~0.offset)))) (= .cse11 8) (forall ((v_prenex_7 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_prenex_10 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (v_prenex_9 (Array Int (Array Int Int))) (v_prenex_8 Int)) (or (let ((.cse15 (+ v_prenex_8 4))) (<= (+ (select (store (select (let ((.cse14 (store v_prenex_9 c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select v_prenex_9 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_prenex_10 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse14 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse14 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 v_prenex_10))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse15 v_DerPreprocessor_4) v_prenex_10) 8) (select |c_#length| (select (store (select (let ((.cse16 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_prenex_10 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 c_ULTIMATE.start_sll_circular_create_~new_head~0.base))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse15 v_DerPreprocessor_2) v_prenex_10)))) (< v_prenex_8 v_prenex_10))) (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_5 Int) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 Int)) (or (<= 0 (+ (select (store (select (let ((.cse17 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_ULTIMATE.start_sll_circular_create_~head~0.offset_28))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 4) v_DerPreprocessor_5) v_ULTIMATE.start_sll_circular_create_~head~0.offset_28) 4)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_31 v_ULTIMATE.start_sll_circular_create_~head~0.offset_28))) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (forall ((v_prenex_7 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_prenex_10 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int) (v_prenex_9 (Array Int (Array Int Int))) (v_prenex_8 Int) (|v_ULTIMATE.start_node_create_#t~malloc5.base_14| Int)) (or (< v_prenex_8 v_prenex_10) (let ((.cse19 (+ v_prenex_8 4))) (<= (+ (select (store (select (let ((.cse18 (store v_prenex_9 |v_ULTIMATE.start_node_create_#t~malloc5.base_14| (store (select v_prenex_9 |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) v_prenex_10 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse18 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse18 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 v_prenex_10))) |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) .cse19 v_DerPreprocessor_4) v_prenex_10) 8) (select (store |c_#length| |v_ULTIMATE.start_node_create_#t~malloc5.base_14| 8) (select (store (select (let ((.cse20 (store |#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_#t~malloc5.base_14| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) v_prenex_10 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse20 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse20 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_7 |v_ULTIMATE.start_node_create_#t~malloc5.base_14|))) |v_ULTIMATE.start_node_create_#t~malloc5.base_14|) .cse19 v_DerPreprocessor_2) v_prenex_10)))) (< 0 (select |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_14|)))) (not (= c_ULTIMATE.start_main_~s~0.base .cse21)) (= c_ULTIMATE.start_main_~s~0.offset 0) (= .cse1 0) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0)))) is different from false [2020-12-09 08:48:39,768 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-12-09 08:48:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:48:40,872 INFO L93 Difference]: Finished difference Result 206 states and 242 transitions. [2020-12-09 08:48:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 08:48:40,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 19 [2020-12-09 08:48:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:48:40,874 INFO L225 Difference]: With dead ends: 206 [2020-12-09 08:48:40,874 INFO L226 Difference]: Without dead ends: 206 [2020-12-09 08:48:40,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=230, Invalid=1583, Unknown=9, NotChecked=340, Total=2162 [2020-12-09 08:48:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-09 08:48:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 71. [2020-12-09 08:48:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 08:48:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2020-12-09 08:48:40,878 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 19 [2020-12-09 08:48:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:48:40,878 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2020-12-09 08:48:40,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 08:48:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2020-12-09 08:48:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 08:48:40,879 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:48:40,879 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:48:41,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2020-12-09 08:48:41,080 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:48:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:48:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2006619038, now seen corresponding path program 2 times [2020-12-09 08:48:41,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:48:41,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992905917] [2020-12-09 08:48:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:48:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:48:41,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992905917] [2020-12-09 08:48:41,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887432016] [2020-12-09 08:48:41,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:48:41,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 08:48:41,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:48:41,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 08:48:41,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:48:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:48:41,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:48:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:48:41,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051736437] [2020-12-09 08:48:41,294 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 08:48:41,294 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:48:41,294 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:48:41,294 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:48:41,294 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:48:41,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,528 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,535 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,734 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,766 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,774 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:41,782 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:42,215 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:42,539 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:42,554 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:42,596 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:43,637 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:48:43,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:48:43,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2020-12-09 08:48:43,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822739665] [2020-12-09 08:48:43,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:48:43,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:48:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:48:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:48:43,639 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2020-12-09 08:48:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:48:43,696 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2020-12-09 08:48:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 08:48:43,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 08:48:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:48:43,697 INFO L225 Difference]: With dead ends: 108 [2020-12-09 08:48:43,697 INFO L226 Difference]: Without dead ends: 108 [2020-12-09 08:48:43,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:48:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-12-09 08:48:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2020-12-09 08:48:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 08:48:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2020-12-09 08:48:43,699 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 21 [2020-12-09 08:48:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:48:43,699 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2020-12-09 08:48:43,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:48:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2020-12-09 08:48:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 08:48:43,700 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:48:43,700 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:48:43,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:48:43,902 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:48:43,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:48:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -829683854, now seen corresponding path program 1 times [2020-12-09 08:48:43,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:48:43,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956735262] [2020-12-09 08:48:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:48:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:48:43,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956735262] [2020-12-09 08:48:43,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:48:43,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 08:48:43,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420068777] [2020-12-09 08:48:43,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:48:43,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:48:43,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:48:43,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:48:43,974 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 7 states. [2020-12-09 08:48:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:48:44,091 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2020-12-09 08:48:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 08:48:44,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-09 08:48:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:48:44,092 INFO L225 Difference]: With dead ends: 96 [2020-12-09 08:48:44,092 INFO L226 Difference]: Without dead ends: 96 [2020-12-09 08:48:44,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:48:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-09 08:48:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 69. [2020-12-09 08:48:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 08:48:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2020-12-09 08:48:44,094 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 23 [2020-12-09 08:48:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:48:44,094 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2020-12-09 08:48:44,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:48:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-12-09 08:48:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 08:48:44,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:48:44,095 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:48:44,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2020-12-09 08:48:44,095 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:48:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:48:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1537801734, now seen corresponding path program 1 times [2020-12-09 08:48:44,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:48:44,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529163074] [2020-12-09 08:48:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:48:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:48:44,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529163074] [2020-12-09 08:48:44,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175200786] [2020-12-09 08:48:44,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:48:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:48:44,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 80 conjunts are in the unsatisfiable core [2020-12-09 08:48:44,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:48:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:48:45,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:48:46,470 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_sll_circular_update_at_~head.offset Int) (ULTIMATE.start_sll_circular_update_at_~data Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (store |c_#memory_int| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ ULTIMATE.start_sll_circular_update_at_~head.offset 4) ULTIMATE.start_sll_circular_update_at_~data)) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (forall ((v_prenex_14 Int) (v_prenex_13 Int)) (< (select (select (store |c_#memory_int| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ v_prenex_13 4) v_prenex_14)) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)) (+ c_ULTIMATE.start_main_~len~0 1)))) is different from false [2020-12-09 08:48:47,877 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (ULTIMATE.start_sll_circular_update_at_~data Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ v_subst_1 4) ULTIMATE.start_sll_circular_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)))) (forall ((v_prenex_14 Int) (v_prenex_13 Int)) (< (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset))) (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ v_prenex_13 4) v_prenex_14))) c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4)) (+ c_ULTIMATE.start_main_~len~0 1)))) is different from false [2020-12-09 08:48:54,642 WARN L197 SmtUtils]: Spent 3.33 s on a formula simplification that was a NOOP. DAG size: 31 [2020-12-09 08:48:54,773 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-12-09 08:48:55,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_16 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ c_ULTIMATE.start_sll_circular_create_~head~0.offset 4) v_prenex_16) c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) is different from false [2020-12-09 08:48:56,178 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:48:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2020-12-09 08:48:56,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314829300] [2020-12-09 08:48:56,187 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 08:48:56,187 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:48:56,187 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:48:56,187 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:48:56,187 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:48:56,251 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:56,422 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:56,615 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:56,647 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:57,074 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:57,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:57,429 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:57,473 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:48:58,515 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:48:58,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:48:58,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 44 [2020-12-09 08:48:58,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431442499] [2020-12-09 08:48:58,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-09 08:48:58,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:48:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-09 08:48:58,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1502, Unknown=22, NotChecked=240, Total=1892 [2020-12-09 08:48:58,517 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 44 states. [2020-12-09 08:48:59,322 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-12-09 08:48:59,621 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2020-12-09 08:48:59,947 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-12-09 08:49:01,467 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-12-09 08:49:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:02,202 INFO L93 Difference]: Finished difference Result 229 states and 252 transitions. [2020-12-09 08:49:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 08:49:02,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 25 [2020-12-09 08:49:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:02,204 INFO L225 Difference]: With dead ends: 229 [2020-12-09 08:49:02,204 INFO L226 Difference]: Without dead ends: 229 [2020-12-09 08:49:02,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=467, Invalid=3063, Unknown=22, NotChecked=354, Total=3906 [2020-12-09 08:49:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-12-09 08:49:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 89. [2020-12-09 08:49:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-12-09 08:49:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2020-12-09 08:49:02,208 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 25 [2020-12-09 08:49:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:02,208 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2020-12-09 08:49:02,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-12-09 08:49:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2020-12-09 08:49:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 08:49:02,208 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:02,208 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:02,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable308 [2020-12-09 08:49:02,410 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1535037346, now seen corresponding path program 1 times [2020-12-09 08:49:02,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:02,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897517823] [2020-12-09 08:49:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:02,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897517823] [2020-12-09 08:49:02,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:02,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:49:02,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040936471] [2020-12-09 08:49:02,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:49:02,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:49:02,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:49:02,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:49:02,470 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 4 states. [2020-12-09 08:49:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:02,493 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2020-12-09 08:49:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:49:02,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-09 08:49:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:02,494 INFO L225 Difference]: With dead ends: 118 [2020-12-09 08:49:02,494 INFO L226 Difference]: Without dead ends: 118 [2020-12-09 08:49:02,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-09 08:49:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2020-12-09 08:49:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 08:49:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2020-12-09 08:49:02,496 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 25 [2020-12-09 08:49:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:02,496 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2020-12-09 08:49:02,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:49:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2020-12-09 08:49:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 08:49:02,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:02,497 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:02,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2020-12-09 08:49:02,497 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash 360775458, now seen corresponding path program 1 times [2020-12-09 08:49:02,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:02,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512410261] [2020-12-09 08:49:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:02,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512410261] [2020-12-09 08:49:02,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:02,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 08:49:02,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552783449] [2020-12-09 08:49:02,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:49:02,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:49:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:49:02,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:02,526 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 5 states. [2020-12-09 08:49:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:02,592 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2020-12-09 08:49:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:49:02,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-09 08:49:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:02,593 INFO L225 Difference]: With dead ends: 107 [2020-12-09 08:49:02,593 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 08:49:02,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:49:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 08:49:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2020-12-09 08:49:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-09 08:49:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2020-12-09 08:49:02,596 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 27 [2020-12-09 08:49:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:02,596 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2020-12-09 08:49:02,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:49:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2020-12-09 08:49:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 08:49:02,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:02,597 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:02,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2020-12-09 08:49:02,597 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 360775459, now seen corresponding path program 1 times [2020-12-09 08:49:02,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:02,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231971771] [2020-12-09 08:49:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:02,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231971771] [2020-12-09 08:49:02,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893996807] [2020-12-09 08:49:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:02,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 08:49:02,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:02,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:02,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [997432401] [2020-12-09 08:49:02,762 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 08:49:02,762 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:49:02,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:49:02,762 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:49:02,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:49:02,817 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:03,011 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:03,199 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:03,227 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:03,627 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:03,970 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:04,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:04,028 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:05,072 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:49:05,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:49:05,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2020-12-09 08:49:05,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889182908] [2020-12-09 08:49:05,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 08:49:05,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:49:05,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 08:49:05,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-09 08:49:05,073 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 10 states. [2020-12-09 08:49:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:05,098 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2020-12-09 08:49:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:49:05,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-12-09 08:49:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:05,099 INFO L225 Difference]: With dead ends: 98 [2020-12-09 08:49:05,099 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 08:49:05,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-12-09 08:49:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 08:49:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2020-12-09 08:49:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-12-09 08:49:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2020-12-09 08:49:05,101 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 27 [2020-12-09 08:49:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:05,101 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2020-12-09 08:49:05,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 08:49:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2020-12-09 08:49:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 08:49:05,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:05,102 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:05,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable389 [2020-12-09 08:49:05,303 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash 182170830, now seen corresponding path program 2 times [2020-12-09 08:49:05,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:05,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61799143] [2020-12-09 08:49:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 08:49:05,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61799143] [2020-12-09 08:49:05,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858291058] [2020-12-09 08:49:05,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:05,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-12-09 08:49:05,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:49:05,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 08:49:05,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:49:05,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:49:05,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:49:05,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 12 [2020-12-09 08:49:05,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850839718] [2020-12-09 08:49:05,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 08:49:05,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:49:05,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 08:49:05,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:49:05,605 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 9 states. [2020-12-09 08:49:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:05,630 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-12-09 08:49:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 08:49:05,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-12-09 08:49:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:05,631 INFO L225 Difference]: With dead ends: 67 [2020-12-09 08:49:05,631 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 08:49:05,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 08:49:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 08:49:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 08:49:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 08:49:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2020-12-09 08:49:05,634 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 28 [2020-12-09 08:49:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:05,634 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2020-12-09 08:49:05,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 08:49:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2020-12-09 08:49:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 08:49:05,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:05,635 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:05,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:05,836 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1281165703, now seen corresponding path program 1 times [2020-12-09 08:49:05,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:05,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124303844] [2020-12-09 08:49:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:05,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124303844] [2020-12-09 08:49:05,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024232469] [2020-12-09 08:49:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:05,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 08:49:05,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:05,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:49:05,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1577350478] [2020-12-09 08:49:05,989 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 08:49:05,989 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:49:05,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:49:05,990 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:49:05,990 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:49:06,046 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:06,226 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:06,405 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:06,433 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:06,830 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:07,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:07,215 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:07,228 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:08,133 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:49:08,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:49:08,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2020-12-09 08:49:08,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388067714] [2020-12-09 08:49:08,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 08:49:08,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:49:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 08:49:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 08:49:08,134 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 6 states. [2020-12-09 08:49:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:08,168 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-12-09 08:49:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:49:08,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-12-09 08:49:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:08,169 INFO L225 Difference]: With dead ends: 64 [2020-12-09 08:49:08,169 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 08:49:08,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:49:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 08:49:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-09 08:49:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 08:49:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2020-12-09 08:49:08,171 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 29 [2020-12-09 08:49:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:08,171 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2020-12-09 08:49:08,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 08:49:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2020-12-09 08:49:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 08:49:08,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:08,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:08,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:08,373 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1283930091, now seen corresponding path program 1 times [2020-12-09 08:49:08,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:08,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380795862] [2020-12-09 08:49:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:49:08,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380795862] [2020-12-09 08:49:08,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513316155] [2020-12-09 08:49:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:08,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 61 conjunts are in the unsatisfiable core [2020-12-09 08:49:08,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:49:09,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:17,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (v_DerPreprocessor_8 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) 1)) is different from false [2020-12-09 08:49:25,134 WARN L197 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 08:49:27,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_9)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8)))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) 1)) is different from false [2020-12-09 08:49:29,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 c_ULTIMATE.start_main_~s~0.offset) (= (select |c_#valid| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 4) v_DerPreprocessor_9))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8)))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) 1))) is different from false [2020-12-09 08:49:31,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (= (select |c_#valid| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 4) v_DerPreprocessor_9))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) 1))) is different from false [2020-12-09 08:49:31,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_48 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 Int)) (or (= (select |c_#valid| (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_48 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 4) v_DerPreprocessor_9))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse2)) (.cse1 (select .cse2 v_ULTIMATE.start_sll_circular_create_~head~0.offset_48))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8))))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_48)) 1) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 v_ULTIMATE.start_sll_circular_create_~head~0.offset_48))) is different from false [2020-12-09 08:49:31,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_48 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 Int)) (or (= (select |c_#valid| (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_48 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_node_create_~temp~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 4) v_DerPreprocessor_9))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_node_create_~temp~0.base .cse2)) (.cse1 (select .cse2 v_ULTIMATE.start_sll_circular_create_~head~0.offset_48))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8))))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_48)) 1) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 v_ULTIMATE.start_sll_circular_create_~head~0.offset_48))) is different from false [2020-12-09 08:49:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2020-12-09 08:49:31,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [96808339] [2020-12-09 08:49:31,781 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 08:49:31,782 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:49:31,782 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:49:31,782 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:49:31,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:49:31,830 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:32,012 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:32,202 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:32,231 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:32,631 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:32,996 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:33,011 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:33,024 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:49:33,968 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:49:33,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:49:33,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 37 [2020-12-09 08:49:33,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616550756] [2020-12-09 08:49:33,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-09 08:49:33,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:49:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-09 08:49:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=863, Unknown=13, NotChecked=390, Total=1406 [2020-12-09 08:49:33,970 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 38 states. [2020-12-09 08:49:34,317 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-12-09 08:49:36,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (and (let ((.cse0 (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~last~0.base) 1)) (.cse1 (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse2 (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base))) (.cse3 (select |c_#valid| 0)) (.cse4 (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~head~0.base) 1))) (or (and .cse0 .cse1 .cse2 (= .cse3 1) .cse4) (and .cse0 .cse1 .cse2 (= .cse3 0) .cse4))) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base .cse5)) (= c_ULTIMATE.start_sll_circular_create_~last~0.base .cse5) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (= (select |c_#valid| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse8 (store (select .cse9 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 4) v_DerPreprocessor_9))) (let ((.cse6 (store .cse9 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse8)) (.cse7 (select .cse8 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) 1))))) is different from false [2020-12-09 08:49:38,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (let ((.cse1 (not (= c_ULTIMATE.start_main_~s~0.base .cse7))) (.cse2 (= (select |c_#valid| .cse7) 1))) (and (let ((.cse0 (select |c_#valid| 0)) (.cse3 (= (select |c_#valid| c_ULTIMATE.start_main_~s~0.base) 1))) (or (and (= .cse0 1) .cse1 .cse2 .cse3 (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset)))) (and (= .cse0 0) .cse1 .cse2 .cse3 (exists ((v_prenex_19 Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) v_prenex_19)))))) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 Int)) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 c_ULTIMATE.start_main_~s~0.offset) (= (select |c_#valid| (select (select (let ((.cse6 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_86 4) v_DerPreprocessor_9))) (let ((.cse4 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse6)) (.cse5 (select .cse6 c_ULTIMATE.start_main_~s~0.offset))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_84 4) v_DerPreprocessor_8)))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) 1))) .cse1 (= c_ULTIMATE.start_main_~s~0.offset 0) .cse2))) is different from false [2020-12-09 08:49:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:38,695 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-12-09 08:49:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 08:49:38,696 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 29 [2020-12-09 08:49:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:38,696 INFO L225 Difference]: With dead ends: 83 [2020-12-09 08:49:38,696 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 08:49:38,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=215, Invalid=1208, Unknown=15, NotChecked=632, Total=2070 [2020-12-09 08:49:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 08:49:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2020-12-09 08:49:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 08:49:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2020-12-09 08:49:38,698 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 29 [2020-12-09 08:49:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:38,698 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2020-12-09 08:49:38,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-09 08:49:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-12-09 08:49:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 08:49:38,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:38,699 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:38,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:38,900 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:49:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1283930090, now seen corresponding path program 1 times [2020-12-09 08:49:38,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:49:38,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024925466] [2020-12-09 08:49:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:49:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:49:39,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024925466] [2020-12-09 08:49:39,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144723598] [2020-12-09 08:49:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:49:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:39,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 73 conjunts are in the unsatisfiable core [2020-12-09 08:49:39,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:49:40,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:45,012 WARN L197 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 47 [2020-12-09 08:49:49,559 WARN L197 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 69 [2020-12-09 08:49:51,594 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_16 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse4 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse0 (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse4 v_DerPreprocessor_16)) (.cse3 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4))) (or (< (select .cse0 c_ULTIMATE.start_main_~s~0.offset) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_main_~s~0.offset) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base .cse0)) (.cse2 (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse4 v_DerPreprocessor_14) c_ULTIMATE.start_main_~s~0.offset))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) 4)) (< .cse3 0))))) (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse11 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse5 (+ v_prenex_27 4)) (.cse8 (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse11 v_DerPreprocessor_17))) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_main_~s~0.offset) (< .cse5 0) (let ((.cse10 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse11 v_DerPreprocessor_15))) (let ((.cse7 (select .cse10 c_ULTIMATE.start_main_~s~0.offset))) (<= (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base .cse8))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse5 v_DerPreprocessor_10))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) 8) (select |c_#length| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse10))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse5 v_DerPreprocessor_13))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))))) (< (select .cse8 c_ULTIMATE.start_main_~s~0.offset) v_prenex_27)))))) is different from false [2020-12-09 08:49:53,627 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse8 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse0 (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse8 v_DerPreprocessor_17)) (.cse1 (+ v_prenex_27 4))) (or (< (select .cse0 c_ULTIMATE.start_sll_circular_create_~head~0.offset) v_prenex_27) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< .cse1 0) (let ((.cse6 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse7 (store (select .cse6 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse8 v_DerPreprocessor_15))) (let ((.cse3 (select .cse7 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (<= (+ (select (select (let ((.cse2 (store .cse4 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse0))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse1 v_DerPreprocessor_10))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 8) (select |c_#length| (select (select (let ((.cse5 (store .cse6 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse7))) (store .cse5 .cse3 (store (select .cse5 .cse3) .cse1 v_DerPreprocessor_13))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)))))))))) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_prenex_29 Int) (v_DerPreprocessor_11 Int) (v_prenex_28 Int) (v_DerPreprocessor_16 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse13 (+ v_prenex_29 4))) (let ((.cse10 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4)) (.cse9 (store (select .cse14 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse13 v_DerPreprocessor_16))) (or (< v_prenex_29 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< (select .cse9 c_ULTIMATE.start_sll_circular_create_~head~0.offset) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< .cse10 0) (<= 0 (+ (select (select (let ((.cse11 (store .cse14 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse9)) (.cse12 (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse13 v_DerPreprocessor_14) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse10 v_DerPreprocessor_11))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 4))))))) is different from false [2020-12-09 08:49:53,872 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_prenex_29 Int) (v_DerPreprocessor_11 Int) (v_prenex_28 Int) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 Int) (v_DerPreprocessor_16 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (let ((.cse5 (let ((.cse7 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse7 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse7 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53)))) (.cse4 (+ v_prenex_29 4))) (let ((.cse6 (store (select .cse5 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse4 v_DerPreprocessor_16)) (.cse2 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4))) (or (<= 0 (+ (select (select (let ((.cse0 (store .cse5 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse6)) (.cse1 (select (store (select (let ((.cse3 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse3 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~new_head~0.base))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse4 v_DerPreprocessor_14) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_11))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) 4)) (< (select .cse6 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< v_prenex_29 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) (< .cse2 0))))) (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_prenex_32 (Array Int (Array Int Int))) (v_prenex_30 Int) (v_prenex_31 (Array Int (Array Int Int))) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse12 (let ((.cse18 (store v_prenex_32 c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select v_prenex_32 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_prenex_30 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse18 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse18 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_prenex_30)))) (.cse16 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse9 (store (select .cse12 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse16 v_DerPreprocessor_17)) (.cse8 (+ v_prenex_27 4))) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 v_prenex_30) (< .cse8 0) (< (select .cse9 v_prenex_30) v_prenex_27) (let ((.cse14 (let ((.cse17 (store v_prenex_31 c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select v_prenex_31 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_prenex_30 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base))))) (let ((.cse15 (store (select .cse14 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse16 v_DerPreprocessor_15))) (let ((.cse11 (select .cse15 v_prenex_30))) (<= (+ (select (select (let ((.cse10 (store .cse12 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse8 v_DerPreprocessor_10))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_prenex_30) 8) (select |c_#length| (select (select (let ((.cse13 (store .cse14 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse15))) (store .cse13 .cse11 (store (select .cse13 .cse11) .cse8 v_DerPreprocessor_13))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) v_prenex_30))))))))))) is different from false [2020-12-09 08:49:54,071 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_prenex_29 Int) (v_DerPreprocessor_11 Int) (v_prenex_28 Int) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 Int) (v_DerPreprocessor_16 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (let ((.cse5 (let ((.cse7 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse7 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse7 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53)))) (.cse4 (+ v_prenex_29 4))) (let ((.cse2 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4)) (.cse6 (store (select .cse5 c_ULTIMATE.start_node_create_~temp~0.base) .cse4 v_DerPreprocessor_16))) (or (<= 0 (+ (select (select (let ((.cse0 (store .cse5 c_ULTIMATE.start_node_create_~temp~0.base .cse6)) (.cse1 (select (store (select (let ((.cse3 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse3 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_node_create_~temp~0.base))) c_ULTIMATE.start_node_create_~temp~0.base) .cse4 v_DerPreprocessor_14) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_11))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) 4)) (< v_prenex_29 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) (< .cse2 0) (< (select .cse6 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95))))) (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_prenex_32 (Array Int (Array Int Int))) (v_prenex_30 Int) (v_prenex_31 (Array Int (Array Int Int))) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse12 (let ((.cse18 (store v_prenex_32 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_32 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_30 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse18 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse18 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_prenex_30)))) (.cse16 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse8 (store (select .cse12 c_ULTIMATE.start_node_create_~temp~0.base) .cse16 v_DerPreprocessor_17)) (.cse11 (+ v_prenex_27 4))) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 v_prenex_30) (< (select .cse8 v_prenex_30) v_prenex_27) (let ((.cse14 (let ((.cse17 (store v_prenex_31 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_31 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_30 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse15 (store (select .cse14 c_ULTIMATE.start_node_create_~temp~0.base) .cse16 v_DerPreprocessor_15))) (let ((.cse10 (select .cse15 v_prenex_30))) (<= (+ (select (select (let ((.cse9 (store .cse12 c_ULTIMATE.start_node_create_~temp~0.base .cse8))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_DerPreprocessor_10))) c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_30) 8) (select |c_#length| (select (select (let ((.cse13 (store .cse14 c_ULTIMATE.start_node_create_~temp~0.base .cse15))) (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_DerPreprocessor_13))) c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_30)))))) (< .cse11 0)))))) is different from false [2020-12-09 08:49:55,946 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-12-09 08:49:57,086 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2020-12-09 08:50:00,524 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-09 08:50:00,560 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:50:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2020-12-09 08:50:00,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [542795589] [2020-12-09 08:50:00,582 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 08:50:00,582 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:50:00,582 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:50:00,582 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:50:00,582 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:50:00,637 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:00,811 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:01,012 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:01,027 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:01,444 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:01,783 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:01,799 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:01,842 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:03,024 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:50:03,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:50:03,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 40 [2020-12-09 08:50:03,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673431526] [2020-12-09 08:50:03,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-09 08:50:03,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:50:03,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-09 08:50:03,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1202, Unknown=19, NotChecked=292, Total=1640 [2020-12-09 08:50:03,026 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 41 states. [2020-12-09 08:50:03,686 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 38 [2020-12-09 08:50:04,138 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 45 [2020-12-09 08:50:06,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (.cse18 (select |c_#length| c_ULTIMATE.start_sll_circular_create_~last~0.base))) (and (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse8 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse0 (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse8 v_DerPreprocessor_17)) (.cse1 (+ v_prenex_27 4))) (or (< (select .cse0 c_ULTIMATE.start_sll_circular_create_~head~0.offset) v_prenex_27) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< .cse1 0) (let ((.cse6 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse7 (store (select .cse6 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse8 v_DerPreprocessor_15))) (let ((.cse3 (select .cse7 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (<= (+ (select (select (let ((.cse2 (store .cse4 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse0))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse1 v_DerPreprocessor_10))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 8) (select |c_#length| (select (select (let ((.cse5 (store .cse6 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse7))) (store .cse5 .cse3 (store (select .cse5 .cse3) .cse1 v_DerPreprocessor_13))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)))))))))) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 0) (= (select |c_#length| c_ULTIMATE.start_sll_circular_create_~head~0.base) 8) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base .cse9)) (= c_ULTIMATE.start_sll_circular_create_~last~0.base .cse9) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_prenex_29 Int) (v_DerPreprocessor_11 Int) (v_prenex_28 Int) (|v_ULTIMATE.start_node_create_#t~malloc5.base_32| Int) (v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 Int) (v_DerPreprocessor_16 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (let ((.cse16 (let ((.cse17 (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_32| (store (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse17 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53)))) (.cse15 (+ v_prenex_29 4))) (let ((.cse11 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4)) (.cse10 (store (select .cse16 |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) .cse15 v_DerPreprocessor_16))) (or (< 0 (select |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_32|)) (< (select .cse10 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< v_prenex_29 v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) (< .cse11 0) (<= 0 (+ (select (select (let ((.cse12 (store .cse16 |v_ULTIMATE.start_node_create_#t~malloc5.base_32| .cse10)) (.cse13 (select (store (select (let ((.cse14 (store |#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_#t~malloc5.base_32| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse14 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse14 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 |v_ULTIMATE.start_node_create_#t~malloc5.base_32|))) |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) .cse15 v_DerPreprocessor_14) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse11 v_DerPreprocessor_11))) |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_ULTIMATE.start_sll_circular_create_~head~0.offset_53) 4)))))) (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (= .cse18 8) (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (|v_ULTIMATE.start_node_create_#t~malloc5.base_32| Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_prenex_32 (Array Int (Array Int Int))) (v_prenex_30 Int) (v_prenex_31 (Array Int (Array Int Int))) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse23 (let ((.cse29 (store v_prenex_32 |v_ULTIMATE.start_node_create_#t~malloc5.base_32| (store (select v_prenex_32 |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_prenex_30 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse29 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse29 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_prenex_30)))) (.cse27 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse19 (store (select .cse23 |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) .cse27 v_DerPreprocessor_17)) (.cse22 (+ v_prenex_27 4))) (or (< 0 (select |c_#valid| |v_ULTIMATE.start_node_create_#t~malloc5.base_32|)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 v_prenex_30) (< (select .cse19 v_prenex_30) v_prenex_27) (let ((.cse25 (let ((.cse28 (store v_prenex_31 |v_ULTIMATE.start_node_create_#t~malloc5.base_32| (store (select v_prenex_31 |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_prenex_30 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse28 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse28 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset |v_ULTIMATE.start_node_create_#t~malloc5.base_32|))))) (let ((.cse26 (store (select .cse25 |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) .cse27 v_DerPreprocessor_15))) (let ((.cse21 (select .cse26 v_prenex_30))) (<= (+ (select (select (let ((.cse20 (store .cse23 |v_ULTIMATE.start_node_create_#t~malloc5.base_32| .cse19))) (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 v_DerPreprocessor_10))) |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_prenex_30) 8) (select (store |c_#length| |v_ULTIMATE.start_node_create_#t~malloc5.base_32| 8) (select (select (let ((.cse24 (store .cse25 |v_ULTIMATE.start_node_create_#t~malloc5.base_32| .cse26))) (store .cse24 .cse21 (store (select .cse24 .cse21) .cse22 v_DerPreprocessor_13))) |v_ULTIMATE.start_node_create_#t~malloc5.base_32|) v_prenex_30)))))) (< .cse22 0))))) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= c_ULTIMATE.start_node_create_~temp~0.base 0) (= (select |c_#valid| 0) 0)) (= (select |c_#valid| |#t~string0.base|) 1) (= (select |c_#valid| |#t~string1.base|) 1))) (<= (+ (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 8) .cse18) (= 8 (select |c_#length| c_ULTIMATE.start_node_create_~temp~0.base)) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_prenex_29 Int) (v_DerPreprocessor_11 Int) (v_prenex_28 Int) (v_DerPreprocessor_16 Int)) (let ((.cse35 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse34 (+ v_prenex_29 4))) (let ((.cse31 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4)) (.cse30 (store (select .cse35 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse34 v_DerPreprocessor_16))) (or (< v_prenex_29 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< (select .cse30 c_ULTIMATE.start_sll_circular_create_~head~0.offset) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< .cse31 0) (<= 0 (+ (select (select (let ((.cse32 (store .cse35 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse30)) (.cse33 (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse34 v_DerPreprocessor_14) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse32 .cse33 (store (select .cse32 .cse33) .cse31 v_DerPreprocessor_11))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 4)))))) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0))) is different from false [2020-12-09 08:50:09,304 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| c_ULTIMATE.start_sll_circular_create_~last~0.base)) (.cse10 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (and (= .cse0 8) (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse9 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse1 (store (select .cse5 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse9 v_DerPreprocessor_17)) (.cse2 (+ v_prenex_27 4))) (or (< (select .cse1 c_ULTIMATE.start_sll_circular_create_~head~0.offset) v_prenex_27) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< .cse2 0) (let ((.cse7 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse8 (store (select .cse7 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse9 v_DerPreprocessor_15))) (let ((.cse4 (select .cse8 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (<= (+ (select (select (let ((.cse3 (store .cse5 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse1))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse2 v_DerPreprocessor_10))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 8) (select |c_#length| (select (select (let ((.cse6 (store .cse7 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse8))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse2 v_DerPreprocessor_13))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)))))))))) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 0) (= (select |c_#length| c_ULTIMATE.start_sll_circular_create_~head~0.base) 8) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base .cse10)) (<= (+ (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 8) .cse0) (= c_ULTIMATE.start_sll_circular_create_~last~0.base .cse10) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_prenex_29 Int) (v_DerPreprocessor_11 Int) (v_prenex_28 Int) (v_DerPreprocessor_16 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse15 (+ v_prenex_29 4))) (let ((.cse12 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4)) (.cse11 (store (select .cse16 c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse15 v_DerPreprocessor_16))) (or (< v_prenex_29 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< (select .cse11 c_ULTIMATE.start_sll_circular_create_~head~0.offset) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< .cse12 0) (<= 0 (+ (select (select (let ((.cse13 (store .cse16 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse11)) (.cse14 (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_28 c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) .cse15 v_DerPreprocessor_14) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse12 v_DerPreprocessor_11))) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 4)))))) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0))) is different from false [2020-12-09 08:50:11,316 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (let ((.cse1 (select |c_#length| .cse14)) (.cse0 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (and (<= (+ .cse0 8) .cse1) (forall ((v_DerPreprocessor_14 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_16 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse6 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse6 v_DerPreprocessor_16)) (.cse5 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_95 4))) (or (< (select .cse2 c_ULTIMATE.start_main_~s~0.offset) v_ULTIMATE.start_sll_circular_update_at_~head.offset_95) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_main_~s~0.offset) (<= 0 (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base .cse2)) (.cse4 (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse6 v_DerPreprocessor_14) c_ULTIMATE.start_main_~s~0.offset))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_DerPreprocessor_11))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) 4)) (< .cse5 0))))) (forall ((v_prenex_27 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_10 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 Int)) (let ((.cse13 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 4))) (let ((.cse7 (+ v_prenex_27 4)) (.cse10 (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) .cse13 v_DerPreprocessor_17))) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_97 c_ULTIMATE.start_main_~s~0.offset) (< .cse7 0) (let ((.cse12 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) .cse13 v_DerPreprocessor_15))) (let ((.cse9 (select .cse12 c_ULTIMATE.start_main_~s~0.offset))) (<= (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base .cse10))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse7 v_DerPreprocessor_10))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) 8) (select |c_#length| (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse12))) (store .cse11 .cse9 (store (select .cse11 .cse9) .cse7 v_DerPreprocessor_13))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))))) (< (select .cse10 c_ULTIMATE.start_main_~s~0.offset) v_prenex_27))))) (= 8 .cse1) (not (= c_ULTIMATE.start_main_~s~0.base .cse14)) (= c_ULTIMATE.start_main_~s~0.offset 0) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (and (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| .cse15) ULTIMATE.start_sll_circular_create_~last~0.offset)) (= (select (select |c_#memory_$Pointer$.offset| .cse15) ULTIMATE.start_sll_circular_create_~last~0.offset) c_ULTIMATE.start_main_~s~0.offset)))) (= .cse0 0) (= (select |c_#length| c_ULTIMATE.start_main_~s~0.base) 8)))) is different from false [2020-12-09 08:50:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:14,000 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2020-12-09 08:50:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 08:50:14,003 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 29 [2020-12-09 08:50:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:14,003 INFO L225 Difference]: With dead ends: 97 [2020-12-09 08:50:14,003 INFO L226 Difference]: Without dead ends: 97 [2020-12-09 08:50:14,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=276, Invalid=1986, Unknown=22, NotChecked=686, Total=2970 [2020-12-09 08:50:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-12-09 08:50:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2020-12-09 08:50:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-09 08:50:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-12-09 08:50:14,005 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 29 [2020-12-09 08:50:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:14,006 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-12-09 08:50:14,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-09 08:50:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-12-09 08:50:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 08:50:14,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:14,006 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:50:14,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:14,207 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:50:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:14,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1201134166, now seen corresponding path program 1 times [2020-12-09 08:50:14,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:50:14,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644666346] [2020-12-09 08:50:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:50:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:50:14,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644666346] [2020-12-09 08:50:14,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130091773] [2020-12-09 08:50:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:14,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 90 conjunts are in the unsatisfiable core [2020-12-09 08:50:14,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:50:15,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:50:18,092 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2020-12-09 08:50:19,466 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~i~0 0) (forall ((v_DerPreprocessor_20 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 4) v_DerPreprocessor_20) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~s~0.base)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2020-12-09 08:50:20,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_20 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 Int)) (or (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 4) v_DerPreprocessor_20) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) is different from false [2020-12-09 08:50:21,907 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:50:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-09 08:50:21,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1937707893] [2020-12-09 08:50:21,916 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-12-09 08:50:21,916 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:50:21,916 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:50:21,916 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:50:21,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:50:21,973 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:22,168 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:22,354 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:22,370 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:22,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:23,130 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:23,145 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:23,197 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:24,233 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:50:24,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:50:24,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 50 [2020-12-09 08:50:24,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243529111] [2020-12-09 08:50:24,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-09 08:50:24,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:50:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-09 08:50:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2118, Unknown=9, NotChecked=186, Total=2450 [2020-12-09 08:50:24,235 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 50 states. [2020-12-09 08:50:26,699 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~last~0.base) 1) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 0) (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= c_ULTIMATE.start_node_create_~temp~0.base 0) (= (select |c_#valid| 0) 0)) (= (select |c_#valid| |#t~string0.base|) 1) (= (select |c_#valid| |#t~string1.base|) 1))) (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_20 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 Int)) (or (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 4) v_DerPreprocessor_20) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0) (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~head~0.base) 1)) is different from false [2020-12-09 08:50:28,429 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 0) (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_20 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 Int)) (or (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (store (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 4) v_DerPreprocessor_20) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0)) is different from false [2020-12-09 08:50:29,653 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~i~0 0) (not (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (= c_ULTIMATE.start_main_~s~0.offset 0) (forall ((v_DerPreprocessor_20 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 4) v_DerPreprocessor_20) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~s~0.base)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_108 c_ULTIMATE.start_main_~s~0.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) 0) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset)))) is different from false [2020-12-09 08:50:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:31,286 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2020-12-09 08:50:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 08:50:31,287 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 31 [2020-12-09 08:50:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:31,287 INFO L225 Difference]: With dead ends: 95 [2020-12-09 08:50:31,287 INFO L226 Difference]: Without dead ends: 95 [2020-12-09 08:50:31,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=319, Invalid=3595, Unknown=12, NotChecked=630, Total=4556 [2020-12-09 08:50:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-09 08:50:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2020-12-09 08:50:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 08:50:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2020-12-09 08:50:31,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 31 [2020-12-09 08:50:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:31,290 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2020-12-09 08:50:31,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-09 08:50:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-12-09 08:50:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 08:50:31,290 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:31,291 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:50:31,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:31,492 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:50:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1203898554, now seen corresponding path program 2 times [2020-12-09 08:50:31,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:50:31,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228720067] [2020-12-09 08:50:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:50:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:50:31,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228720067] [2020-12-09 08:50:31,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305805368] [2020-12-09 08:50:31,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:31,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 08:50:31,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:50:31,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 08:50:31,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:50:31,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:50:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:50:31,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [21211302] [2020-12-09 08:50:31,746 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 08:50:31,746 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:50:31,746 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:50:31,746 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:50:31,746 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:50:31,799 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:31,995 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:32,183 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:32,198 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:32,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:32,993 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:33,008 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:33,023 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:34,069 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:50:34,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:50:34,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2020-12-09 08:50:34,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195617931] [2020-12-09 08:50:34,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:50:34,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:50:34,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:50:34,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:50:34,070 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 7 states. [2020-12-09 08:50:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:34,141 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-12-09 08:50:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 08:50:34,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-12-09 08:50:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:34,142 INFO L225 Difference]: With dead ends: 57 [2020-12-09 08:50:34,142 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 08:50:34,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-09 08:50:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 08:50:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-12-09 08:50:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 08:50:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-12-09 08:50:34,143 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2020-12-09 08:50:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:34,144 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-12-09 08:50:34,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:50:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-12-09 08:50:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 08:50:34,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:34,144 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:50:34,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:34,346 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:50:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1058328007, now seen corresponding path program 1 times [2020-12-09 08:50:34,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:50:34,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015312664] [2020-12-09 08:50:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:50:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:50:34,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015312664] [2020-12-09 08:50:34,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:50:34,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 08:50:34,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265510632] [2020-12-09 08:50:34,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:50:34,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:50:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:50:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:50:34,432 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2020-12-09 08:50:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:34,571 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-12-09 08:50:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 08:50:34,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-12-09 08:50:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:34,572 INFO L225 Difference]: With dead ends: 55 [2020-12-09 08:50:34,572 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 08:50:34,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:50:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 08:50:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-09 08:50:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 08:50:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-12-09 08:50:34,573 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 33 [2020-12-09 08:50:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:34,574 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-12-09 08:50:34,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:50:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-12-09 08:50:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 08:50:34,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:34,574 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:50:34,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2020-12-09 08:50:34,574 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:50:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1551536279, now seen corresponding path program 1 times [2020-12-09 08:50:34,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:50:34,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683863762] [2020-12-09 08:50:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:50:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:50:34,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683863762] [2020-12-09 08:50:34,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:50:34,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 08:50:34,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171425427] [2020-12-09 08:50:34,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 08:50:34,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:50:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 08:50:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 08:50:34,628 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 8 states. [2020-12-09 08:50:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:34,725 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-12-09 08:50:34,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 08:50:34,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-12-09 08:50:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:34,726 INFO L225 Difference]: With dead ends: 55 [2020-12-09 08:50:34,726 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 08:50:34,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-09 08:50:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 08:50:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-09 08:50:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 08:50:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-12-09 08:50:34,727 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 34 [2020-12-09 08:50:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:34,728 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-12-09 08:50:34,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 08:50:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-12-09 08:50:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 08:50:34,728 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:34,728 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:50:34,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2020-12-09 08:50:34,728 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:50:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash -853979747, now seen corresponding path program 1 times [2020-12-09 08:50:34,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:50:34,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408124781] [2020-12-09 08:50:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:50:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:50:34,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408124781] [2020-12-09 08:50:34,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101905814] [2020-12-09 08:50:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:34,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 67 conjunts are in the unsatisfiable core [2020-12-09 08:50:34,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:50:35,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:50:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:50:35,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968279387] [2020-12-09 08:50:35,314 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 08:50:35,314 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:50:35,314 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:50:35,315 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:50:35,315 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:50:35,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,565 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,573 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,581 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,780 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,798 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,808 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:35,815 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:36,291 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:36,654 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:36,670 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:36,683 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:50:37,789 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:50:37,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:50:37,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 6] total 21 [2020-12-09 08:50:37,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737126848] [2020-12-09 08:50:37,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 08:50:37,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:50:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 08:50:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2020-12-09 08:50:37,790 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2020-12-09 08:50:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:38,415 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2020-12-09 08:50:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 08:50:38,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2020-12-09 08:50:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:38,416 INFO L225 Difference]: With dead ends: 62 [2020-12-09 08:50:38,416 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 08:50:38,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 08:50:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 08:50:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2020-12-09 08:50:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 08:50:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-12-09 08:50:38,417 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 35 [2020-12-09 08:50:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:38,417 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-12-09 08:50:38,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 08:50:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-12-09 08:50:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 08:50:38,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:38,418 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:50:38,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable868 [2020-12-09 08:50:38,619 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:50:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash -853979746, now seen corresponding path program 1 times [2020-12-09 08:50:38,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:50:38,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476826787] [2020-12-09 08:50:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:50:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:50:38,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476826787] [2020-12-09 08:50:38,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2311297] [2020-12-09 08:50:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:50:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:39,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 81 conjunts are in the unsatisfiable core [2020-12-09 08:50:39,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:50:40,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:50:54,726 WARN L197 SmtUtils]: Spent 14.03 s on a formula simplification that was a NOOP. DAG size: 39 [2020-12-09 08:50:59,057 WARN L197 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 42 [2020-12-09 08:51:13,650 WARN L197 SmtUtils]: Spent 14.04 s on a formula simplification that was a NOOP. DAG size: 40 [2020-12-09 08:51:23,512 WARN L197 SmtUtils]: Spent 3.57 s on a formula simplification that was a NOOP. DAG size: 60 [2020-12-09 08:51:52,029 WARN L197 SmtUtils]: Spent 16.06 s on a formula simplification that was a NOOP. DAG size: 59 [2020-12-09 08:51:52,254 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-09 08:52:08,796 WARN L197 SmtUtils]: Spent 16.09 s on a formula simplification that was a NOOP. DAG size: 85 [2020-12-09 08:52:35,835 WARN L197 SmtUtils]: Spent 24.16 s on a formula simplification that was a NOOP. DAG size: 85 [2020-12-09 08:52:39,402 WARN L197 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 08:52:39,815 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_26 Int) (v_prenex_43 (Array Int (Array Int Int))) (v_prenex_41 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_137 Int) (v_prenex_42 (Array Int (Array Int Int))) (v_subst_3 Int) (v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 Int)) (or (< c_ULTIMATE.start_node_create_~temp~0.offset v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (< v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 0) (< v_prenex_41 0) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_137 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (<= (select (select (let ((.cse3 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_137 4))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (store v_prenex_43 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_43 c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse5 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse5 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_41 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))))) (store .cse4 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse4 c_ULTIMATE.start_node_create_~temp~0.base) .cse3 v_DerPreprocessor_26)))) (.cse1 (select (store (select (let ((.cse2 (store v_prenex_42 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_42 c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse2 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse2 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_41 c_ULTIMATE.start_node_create_~temp~0.base))) c_ULTIMATE.start_node_create_~temp~0.base) .cse3 v_DerPreprocessor_28) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_subst_3 4) v_DerPreprocessor_25)))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) v_prenex_41))) (forall ((v_prenex_39 Int) (v_DerPreprocessor_23 Int) (v_prenex_45 Int) (v_prenex_46 (Array Int (Array Int Int))) (v_prenex_44 Int) (v_prenex_40 Int) (v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 Int)) (or (< c_ULTIMATE.start_node_create_~temp~0.offset v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (< v_prenex_44 0) (< v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 0) (= (select (select (let ((.cse9 (let ((.cse10 (store v_prenex_46 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_46 c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse10 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse10 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_44 c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse8 (store (select .cse9 c_ULTIMATE.start_node_create_~temp~0.base) (+ v_prenex_45 4) v_prenex_39))) (let ((.cse6 (store .cse9 c_ULTIMATE.start_node_create_~temp~0.base .cse8)) (.cse7 (select .cse8 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))) (store .cse6 .cse7 (store (select .cse6 .cse7) (+ v_prenex_40 4) v_DerPreprocessor_23))))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) c_ULTIMATE.start_sll_circular_create_~last~0.base) (< v_prenex_45 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))) (forall ((v_prenex_38 Int) (v_DerPreprocessor_24 Int) (v_prenex_37 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_27 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 Int)) (or (< c_ULTIMATE.start_node_create_~temp~0.offset v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (< v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 0) (< v_prenex_38 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (<= 0 (select (select (let ((.cse14 (+ v_prenex_38 4))) (let ((.cse11 (let ((.cse15 (let ((.cse16 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))))) (store .cse15 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse15 c_ULTIMATE.start_node_create_~temp~0.base) .cse14 v_DerPreprocessor_27)))) (.cse12 (select (store (select (let ((.cse13 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse13 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse13 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))) c_ULTIMATE.start_node_create_~temp~0.base) .cse14 v_DerPreprocessor_29) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ v_prenex_37 4) v_DerPreprocessor_24)))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25)) (< ULTIMATE.start_sll_circular_create_~last~0.offset 0)))) is different from false [2020-12-09 08:52:40,319 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_39 Int) (v_DerPreprocessor_23 Int) (v_prenex_45 Int) (v_prenex_46 (Array Int (Array Int Int))) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_40 Int)) (or (< v_prenex_44 0) (< c_ULTIMATE.start_node_create_~temp~0.offset v_prenex_47) (< v_prenex_47 0) (< v_prenex_45 v_prenex_47) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select (let ((.cse3 (let ((.cse4 (store v_prenex_46 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_46 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_47 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_44 c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_node_create_~temp~0.base) (+ v_prenex_45 4) v_prenex_39))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_node_create_~temp~0.base .cse2)) (.cse1 (select .cse2 v_prenex_47))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_prenex_40 4) v_DerPreprocessor_23))))) c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_47)))) (forall ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_26 Int) (v_prenex_43 (Array Int (Array Int Int))) (v_prenex_41 Int) (v_prenex_42 (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_137 Int) (v_subst_3 Int) (v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 Int)) (or (< c_ULTIMATE.start_node_create_~temp~0.offset v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (< v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 0) (< v_prenex_41 0) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_137 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) (<= (select (select (let ((.cse8 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_137 4))) (let ((.cse5 (let ((.cse9 (let ((.cse10 (store v_prenex_43 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_43 c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse10 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse10 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_41 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))))) (store .cse9 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse9 c_ULTIMATE.start_node_create_~temp~0.base) .cse8 v_DerPreprocessor_26)))) (.cse6 (select (store (select (let ((.cse7 (store v_prenex_42 c_ULTIMATE.start_node_create_~temp~0.base (store (select v_prenex_42 c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse7 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse7 c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_41 c_ULTIMATE.start_node_create_~temp~0.base))) c_ULTIMATE.start_node_create_~temp~0.base) .cse8 v_DerPreprocessor_28) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ v_subst_3 4) v_DerPreprocessor_25)))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_25) v_prenex_41))) (forall ((v_prenex_38 Int) (v_DerPreprocessor_24 Int) (v_prenex_48 Int) (v_prenex_37 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_27 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int)))) (or (<= 0 (select (select (let ((.cse14 (+ v_prenex_38 4))) (let ((.cse11 (let ((.cse15 (let ((.cse16 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_48 c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset v_prenex_48))))) (store .cse15 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse15 c_ULTIMATE.start_node_create_~temp~0.base) .cse14 v_DerPreprocessor_27)))) (.cse12 (select (store (select (let ((.cse13 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_48 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse13 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse13 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))) c_ULTIMATE.start_node_create_~temp~0.base) .cse14 v_DerPreprocessor_29) v_prenex_48))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ v_prenex_37 4) v_DerPreprocessor_24)))) c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_48)) (< v_prenex_38 v_prenex_48) (< c_ULTIMATE.start_node_create_~temp~0.offset v_prenex_48) (< v_prenex_48 0) (< ULTIMATE.start_sll_circular_create_~last~0.offset 0)))) is different from false [2020-12-09 08:52:44,842 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-12-09 08:52:49,502 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2020-12-09 08:52:49,568 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:52:49,680 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-12-09 08:52:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:52:50,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1104064835] [2020-12-09 08:52:50,800 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 08:52:50,800 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:52:50,800 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:52:50,800 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:52:50,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:52:50,867 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,108 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,119 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,130 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,355 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,374 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,408 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,418 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:51,867 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:52,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:52,236 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:52,298 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:52:53,431 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:52:53,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:52:53,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 45 [2020-12-09 08:52:53,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509214180] [2020-12-09 08:52:53,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-12-09 08:52:53,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:52:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-12-09 08:52:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1788, Unknown=22, NotChecked=174, Total=2162 [2020-12-09 08:52:53,433 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 47 states. [2020-12-09 08:52:55,743 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 55 [2020-12-09 08:53:06,200 WARN L197 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2020-12-09 08:53:11,522 WARN L197 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 109 DAG size of output: 48 [2020-12-09 08:53:17,630 WARN L197 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 104 DAG size of output: 46 [2020-12-09 08:53:23,352 WARN L197 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2020-12-09 08:53:28,789 WARN L197 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 122 DAG size of output: 64 [2020-12-09 08:53:37,808 WARN L197 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2020-12-09 08:53:43,202 WARN L197 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-12-09 08:53:49,854 WARN L197 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2020-12-09 08:53:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:53:51,878 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-12-09 08:53:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-09 08:53:51,879 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 35 [2020-12-09 08:53:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:53:51,879 INFO L225 Difference]: With dead ends: 63 [2020-12-09 08:53:51,879 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 08:53:51,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 171.2s TimeCoverageRelationStatistics Valid=485, Invalid=3281, Unknown=24, NotChecked=242, Total=4032 [2020-12-09 08:53:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 08:53:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-12-09 08:53:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 08:53:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-12-09 08:53:51,882 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 35 [2020-12-09 08:53:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:53:51,882 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-12-09 08:53:51,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-12-09 08:53:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-12-09 08:53:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 08:53:51,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:53:51,882 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:53:52,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:53:52,084 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:53:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:53:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -703518804, now seen corresponding path program 1 times [2020-12-09 08:53:52,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:53:52,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301614595] [2020-12-09 08:53:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:53:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:53:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:53:52,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301614595] [2020-12-09 08:53:52,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:53:52,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 08:53:52,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767447895] [2020-12-09 08:53:52,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:53:52,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:53:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:53:52,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 08:53:52,151 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2020-12-09 08:53:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:53:52,272 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-12-09 08:53:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 08:53:52,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-12-09 08:53:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:53:52,273 INFO L225 Difference]: With dead ends: 55 [2020-12-09 08:53:52,273 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 08:53:52,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:53:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 08:53:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-09 08:53:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 08:53:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-12-09 08:53:52,274 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 36 [2020-12-09 08:53:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:53:52,274 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-12-09 08:53:52,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:53:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-12-09 08:53:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 08:53:52,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:53:52,274 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:53:52,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2020-12-09 08:53:52,275 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:53:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:53:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash -335743838, now seen corresponding path program 1 times [2020-12-09 08:53:52,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:53:52,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286348360] [2020-12-09 08:53:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:53:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:53:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 08:53:52,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286348360] [2020-12-09 08:53:52,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242787222] [2020-12-09 08:53:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:53:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:53:52,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 68 conjunts are in the unsatisfiable core [2020-12-09 08:53:52,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:53:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:53:53,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:53:55,430 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 24 [2020-12-09 08:53:55,898 WARN L197 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-09 08:54:04,165 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2020-12-09 08:54:18,309 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2020-12-09 08:54:20,419 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2020-12-09 08:54:20,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_149 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_147 Int) (v_DerPreprocessor_31 Int) (v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26 Int) (v_DerPreprocessor_30 Int)) (or (< v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26 0) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_149 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26) (< c_ULTIMATE.start_node_create_~temp~0.offset v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26) (<= (+ (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26 c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_node_create_~temp~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_149 4) v_DerPreprocessor_31))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_node_create_~temp~0.base .cse2)) (.cse1 (select .cse2 v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_147 4) v_DerPreprocessor_30))))) c_ULTIMATE.start_node_create_~temp~0.base) v_ULTIMATE.start_sll_circular_create_~new_head~0.offset_26) 1) |c_#StackHeapBarrier|))) is different from false [2020-12-09 08:54:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:54:21,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848084657] [2020-12-09 08:54:21,915 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2020-12-09 08:54:21,915 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:54:21,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:54:21,915 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:54:21,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:54:21,997 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:22,196 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:22,205 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:22,214 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:22,573 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:22,667 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:23,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:23,103 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:23,132 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:23,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:23,313 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:23,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:24,006 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:24,224 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:54:24,707 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-09 08:54:25,304 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-09 08:54:25,886 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:54:25,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:54:25,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 41 [2020-12-09 08:54:25,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422351461] [2020-12-09 08:54:25,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-12-09 08:54:25,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:54:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-12-09 08:54:25,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1518, Unknown=28, NotChecked=80, Total=1806 [2020-12-09 08:54:25,888 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 43 states. [2020-12-09 08:54:26,380 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2020-12-09 08:54:31,571 WARN L197 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-12-09 08:54:37,811 WARN L197 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-12-09 08:54:42,281 WARN L197 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-12-09 08:54:46,638 WARN L197 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-09 08:54:51,365 WARN L197 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-12-09 08:54:55,650 WARN L197 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-12-09 08:54:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:54:56,023 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2020-12-09 08:54:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 08:54:56,024 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 37 [2020-12-09 08:54:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:54:56,024 INFO L225 Difference]: With dead ends: 60 [2020-12-09 08:54:56,024 INFO L226 Difference]: Without dead ends: 60 [2020-12-09 08:54:56,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 56.6s TimeCoverageRelationStatistics Valid=449, Invalid=2607, Unknown=28, NotChecked=108, Total=3192 [2020-12-09 08:54:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-09 08:54:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2020-12-09 08:54:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 08:54:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-12-09 08:54:56,027 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 37 [2020-12-09 08:54:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:54:56,027 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-12-09 08:54:56,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-12-09 08:54:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-12-09 08:54:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 08:54:56,027 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:54:56,027 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:54:56,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1028 [2020-12-09 08:54:56,229 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:54:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:54:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 911909278, now seen corresponding path program 1 times [2020-12-09 08:54:56,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:54:56,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304023178] [2020-12-09 08:54:56,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:54:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:54:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:54:56,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304023178] [2020-12-09 08:54:56,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105162657] [2020-12-09 08:54:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:54:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:54:56,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 68 conjunts are in the unsatisfiable core [2020-12-09 08:54:56,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:54:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:54:58,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:55:22,460 WARN L197 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 08:55:40,608 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-12-09 08:55:42,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= c_ULTIMATE.start_main_~s~0.base (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset))))) is different from false [2020-12-09 08:55:44,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (v_DerPreprocessor_33 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_33)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_main_~s~0.base)))) is different from false [2020-12-09 08:55:46,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_main_~s~0.base)) (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_main_~s~0.offset))) is different from false [2020-12-09 08:55:48,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset))))) is different from false [2020-12-09 08:55:48,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32))))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_sll_circular_create_~new_head~0.base)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) is different from false [2020-12-09 08:55:49,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) c_ULTIMATE.start_node_create_~temp~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_node_create_~temp~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_node_create_~temp~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_node_create_~temp~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32))))) c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_node_create_~temp~0.base)) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_node_create_~temp~0.offset))) is different from false [2020-12-09 08:55:50,494 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:55:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2020-12-09 08:55:50,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026066435] [2020-12-09 08:55:50,508 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2020-12-09 08:55:50,508 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:55:50,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:55:50,508 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:55:50,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:55:50,574 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:50,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,164 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,271 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,620 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,712 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,723 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,757 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:51,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:52,449 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:52,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:52,915 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:53,339 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:53,352 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:53,363 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:55:53,397 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:55:53,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:55:53,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 43 [2020-12-09 08:55:53,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812780832] [2020-12-09 08:55:53,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-12-09 08:55:53,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:55:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-12-09 08:55:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1205, Unknown=20, NotChecked=450, Total=1806 [2020-12-09 08:55:53,398 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 43 states. [2020-12-09 08:55:56,381 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~last~0.base) 1) (<= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset))))) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (exists ((|#t~string0.base| Int) (|#t~string1.base| Int)) (and (or (= |#t~string0.base| 0) (= |#t~string1.base| 0) (= c_ULTIMATE.start_node_create_~temp~0.base 0) (= (select |c_#valid| 0) 0)) (= (select |c_#valid| |#t~string0.base|) 1) (= (select |c_#valid| |#t~string1.base|) 1))) (<= 0 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~head~0.base) 1)) is different from false [2020-12-09 08:55:58,389 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0) (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_sll_circular_create_~head~0.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset))))) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base)) (<= 0 c_ULTIMATE.start_sll_circular_create_~head~0.offset)) is different from false [2020-12-09 08:56:00,395 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 c_ULTIMATE.start_main_~s~0.offset) (<= c_ULTIMATE.start_main_~s~0.offset 0) (not (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (v_DerPreprocessor_33 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 4) v_DerPreprocessor_33))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_main_~s~0.base)) (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_165 c_ULTIMATE.start_main_~s~0.offset))) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset)))) is different from false [2020-12-09 08:56:02,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base))) (and (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_circular_update_at_~head.base) (not (= c_ULTIMATE.start_main_~s~0.base (select .cse0 c_ULTIMATE.start_sll_circular_update_at_~head.offset))) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (<= 0 c_ULTIMATE.start_sll_circular_update_at_~head.offset) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (v_DerPreprocessor_33 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_33)))) (let ((.cse2 (select (select .cse1 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_main_~s~0.base)))) (<= c_ULTIMATE.start_main_~s~0.offset 0) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset) c_ULTIMATE.start_main_~s~0.base)) (<= c_ULTIMATE.start_main_~s~0.offset c_ULTIMATE.start_sll_circular_update_at_~head.offset) (<= c_ULTIMATE.start_sll_circular_update_at_~head.offset 0) (not (= c_ULTIMATE.start_main_~s~0.base (select .cse0 c_ULTIMATE.start_main_~s~0.offset))) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset))))) is different from false [2020-12-09 08:56:04,409 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_circular_update_at_~head.base) (<= 0 c_ULTIMATE.start_main_~s~0.offset) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 Int) (v_DerPreprocessor_33 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_32 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_33)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_163 4) v_DerPreprocessor_32)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) c_ULTIMATE.start_main_~s~0.base)))) (<= c_ULTIMATE.start_main_~s~0.offset 0) (<= c_ULTIMATE.start_main_~s~0.offset c_ULTIMATE.start_sll_circular_update_at_~head.offset) (not (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset)))) is different from false [2020-12-09 08:56:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:56:07,826 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-12-09 08:56:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 08:56:07,827 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2020-12-09 08:56:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:56:07,827 INFO L225 Difference]: With dead ends: 54 [2020-12-09 08:56:07,828 INFO L226 Difference]: Without dead ends: 54 [2020-12-09 08:56:07,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 11 IntricatePredicates, 2 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 64.0s TimeCoverageRelationStatistics Valid=247, Invalid=1842, Unknown=25, NotChecked=1078, Total=3192 [2020-12-09 08:56:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-09 08:56:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-12-09 08:56:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 08:56:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2020-12-09 08:56:07,830 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 39 [2020-12-09 08:56:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:56:07,830 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2020-12-09 08:56:07,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-12-09 08:56:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-12-09 08:56:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 08:56:07,830 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:56:07,830 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:56:08,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:56:08,032 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:56:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:56:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 834339900, now seen corresponding path program 1 times [2020-12-09 08:56:08,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:56:08,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526283977] [2020-12-09 08:56:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:56:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:56:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 08:56:08,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526283977] [2020-12-09 08:56:08,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570124555] [2020-12-09 08:56:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:56:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:56:08,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 92 conjunts are in the unsatisfiable core [2020-12-09 08:56:08,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:56:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 08:56:09,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:56:15,197 WARN L197 SmtUtils]: Spent 4.75 s on a formula simplification that was a NOOP. DAG size: 49 [2020-12-09 08:56:26,131 WARN L197 SmtUtils]: Spent 8.79 s on a formula simplification that was a NOOP. DAG size: 55 [2020-12-09 08:56:40,515 WARN L197 SmtUtils]: Spent 12.08 s on a formula simplification that was a NOOP. DAG size: 56 [2020-12-09 08:56:40,692 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 08:56:40,839 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-12-09 08:57:01,867 WARN L197 SmtUtils]: Spent 14.09 s on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 08:57:20,814 WARN L197 SmtUtils]: Spent 12.30 s on a formula simplification that was a NOOP. DAG size: 73 [2020-12-09 08:57:33,194 WARN L197 SmtUtils]: Spent 12.07 s on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 08:57:35,426 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 105 [2020-12-09 08:57:40,587 WARN L197 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 105 [2020-12-09 08:57:58,872 WARN L197 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-12-09 08:58:06,295 WARN L197 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-09 08:58:06,378 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:58:06,387 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 08:58:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 1 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 08:58:06,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1261268542] [2020-12-09 08:58:06,419 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2020-12-09 08:58:06,419 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:58:06,419 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:58:06,419 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:58:06,419 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:58:06,492 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:06,729 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:07,033 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:07,167 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:07,542 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:07,676 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:07,869 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:08,357 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:08,626 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:08,822 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:09,222 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:09,237 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:09,247 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:58:09,277 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:58:09,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:58:09,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 18] total 47 [2020-12-09 08:58:09,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347920481] [2020-12-09 08:58:09,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-12-09 08:58:09,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:58:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-12-09 08:58:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1952, Unknown=7, NotChecked=0, Total=2162 [2020-12-09 08:58:09,279 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 47 states. [2020-12-09 08:58:11,894 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 18 [2020-12-09 08:58:16,431 WARN L197 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 128 [2020-12-09 08:58:20,020 WARN L197 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 144 [2020-12-09 08:58:25,117 WARN L197 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 151 DAG size of output: 148 [2020-12-09 08:58:29,865 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_ULTIMATE.start_sll_circular_create_~new_head~0.offset 0)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) (.cse17 (< c_ULTIMATE.start_main_~s~0.offset 0))) (and (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (= .cse0 c_ULTIMATE.start_sll_circular_update_at_~head.base) (= c_ULTIMATE.start_sll_circular_create_~last~0.base .cse2) (or .cse3 (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_36 Int) (v_prenex_68 (Array Int (Array Int Int))) (v_prenex_67 (Array Int (Array Int Int))) (v_DerPreprocessor_38 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 Int) (v_DerPreprocessor_40 Int)) (let ((.cse10 (let ((.cse16 (store v_prenex_67 c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select v_prenex_67 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse16 c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base)))) (.cse14 (+ c_ULTIMATE.start_sll_circular_create_~new_head~0.offset 4))) (let ((.cse13 (let ((.cse15 (store v_prenex_68 c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select v_prenex_68 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse15 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse15 c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)))) (.cse11 (store (select .cse10 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse14 v_DerPreprocessor_40))) (let ((.cse8 (select .cse11 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)) (.cse9 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 4)) (.cse4 (store (select .cse13 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse14 v_DerPreprocessor_38))) (let ((.cse6 (let ((.cse12 (store .cse13 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse4))) (store .cse12 .cse8 (store (select .cse12 .cse8) .cse9 v_DerPreprocessor_36))))) (let ((.cse5 (select (select .cse6 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (or (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 (select .cse4 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)) (< 0 .cse5) (= (select (select .cse6 (select (select (let ((.cse7 (store .cse10 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_DerPreprocessor_35))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)) .cse5) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset) (< .cse5 0))))))))) (= (select |c_#valid| c_ULTIMATE.start_node_create_~temp~0.base) 1) (not (= (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) .cse1)) (or .cse17 (forall ((v_DerPreprocessor_35 Int) (v_DerPreprocessor_36 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset)) (.cse20 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 4))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse19 (store (select |c_#memory_$Pointer$.offset| .cse19) .cse20 v_DerPreprocessor_36)))) (let ((.cse21 (select (select .cse18 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (or (= (select (select .cse18 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (select |c_#memory_$Pointer$.base| .cse19) .cse20 v_DerPreprocessor_35)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) .cse21) c_ULTIMATE.start_main_~s~0.offset) (< 0 .cse21) (< .cse21 0) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset)))))))) (<= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_update_at_~head.base) .cse1) c_ULTIMATE.start_main_~s~0.offset) (= c_ULTIMATE.start_sll_circular_create_~last~0.offset 0) (= c_ULTIMATE.start_sll_circular_update_at_~head.offset 0) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset) 0) (<= 0 .cse1) (or (forall ((v_DerPreprocessor_34 Int) (v_DerPreprocessor_39 Int) (v_prenex_66 Int) (v_DerPreprocessor_37 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (|#memory_$Pointer$.offset| (Array Int (Array Int Int))) (v_DerPreprocessor_41 Int)) (let ((.cse27 (let ((.cse34 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse34 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse34 c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base)))) (.cse32 (+ c_ULTIMATE.start_sll_circular_create_~new_head~0.offset 4))) (let ((.cse31 (let ((.cse33 (store |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.offset)))) (store .cse33 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse33 c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)))) (.cse28 (store (select .cse27 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse32 v_DerPreprocessor_41))) (let ((.cse25 (select .cse28 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)) (.cse26 (+ v_prenex_66 4)) (.cse29 (store (select .cse31 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) .cse32 v_DerPreprocessor_39))) (let ((.cse22 (select (select (let ((.cse30 (store .cse31 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse29))) (store .cse30 .cse25 (store (select .cse30 .cse25) .cse26 v_DerPreprocessor_37))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (or (< .cse22 0) (= (select (let ((.cse23 (let ((.cse24 (store .cse27 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse28))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 v_DerPreprocessor_34))))) (select .cse23 (select (select .cse23 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) .cse22) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) (< 0 .cse22) (< v_prenex_66 (select .cse29 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)))))))) .cse3) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base .cse2)) (<= .cse1 0) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) .cse1)) (= c_ULTIMATE.start_node_create_~temp~0.offset 0) (not (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_circular_update_at_~head.base)) (<= .cse1 c_ULTIMATE.start_sll_circular_update_at_~head.offset) (not (= c_ULTIMATE.start_main_~s~0.base .cse0)) (= c_ULTIMATE.start_main_~s~0.offset 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) c_ULTIMATE.start_main_~s~0.offset) (= .cse1 0) (or (forall ((v_DerPreprocessor_34 Int) (v_DerPreprocessor_37 Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 Int)) (let ((.cse37 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset)) (.cse38 (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 4))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.offset| .cse37 (store (select |c_#memory_$Pointer$.offset| .cse37) .cse38 v_DerPreprocessor_37)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (or (< .cse35 0) (= c_ULTIMATE.start_main_~s~0.base (select (let ((.cse36 (store |c_#memory_$Pointer$.base| .cse37 (store (select |c_#memory_$Pointer$.base| .cse37) .cse38 v_DerPreprocessor_34)))) (select .cse36 (select (select .cse36 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) .cse35)) (< 0 .cse35) (< v_ULTIMATE.start_sll_circular_update_at_~head.offset_175 (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset)))))) .cse17) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0))) is different from false [2020-12-09 08:58:33,538 WARN L197 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 94 DAG size of output: 27 [2020-12-09 08:58:36,922 WARN L197 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 99 DAG size of output: 42 [2020-12-09 08:58:40,132 WARN L197 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2020-12-09 08:58:42,948 WARN L197 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2020-12-09 08:58:46,020 WARN L197 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2020-12-09 08:58:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:58:46,825 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2020-12-09 08:58:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 08:58:46,828 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 40 [2020-12-09 08:58:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:58:46,829 INFO L225 Difference]: With dead ends: 46 [2020-12-09 08:58:46,829 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 08:58:46,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 143.2s TimeCoverageRelationStatistics Valid=423, Invalid=2995, Unknown=8, NotChecked=114, Total=3540 [2020-12-09 08:58:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 08:58:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-09 08:58:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 08:58:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2020-12-09 08:58:46,831 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 40 [2020-12-09 08:58:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:58:46,831 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2020-12-09 08:58:46,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-12-09 08:58:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2020-12-09 08:58:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 08:58:46,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:58:46,831 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:58:47,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1232 [2020-12-09 08:58:47,033 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:58:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:58:47,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1356703369, now seen corresponding path program 1 times [2020-12-09 08:58:47,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:58:47,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534726476] [2020-12-09 08:58:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:58:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:58:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:58:47,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534726476] [2020-12-09 08:58:47,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135454318] [2020-12-09 08:58:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:58:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:58:47,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 08:58:47,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:58:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:58:48,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:59:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:59:23,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201437821] [2020-12-09 08:59:23,802 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2020-12-09 08:59:23,802 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:59:23,803 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:59:23,803 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:59:23,803 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:59:23,882 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:24,150 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:24,489 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:24,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:24,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:25,115 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:25,348 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:25,768 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:26,097 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:26,299 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:26,744 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:26,758 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:26,770 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 08:59:26,804 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:59:26,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:59:26,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2020-12-09 08:59:26,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681810251] [2020-12-09 08:59:26,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-09 08:59:26,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:59:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-09 08:59:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1034, Unknown=14, NotChecked=0, Total=1190 [2020-12-09 08:59:26,805 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand 35 states. [2020-12-09 08:59:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:59:28,233 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2020-12-09 08:59:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 08:59:28,234 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2020-12-09 08:59:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:59:28,234 INFO L225 Difference]: With dead ends: 45 [2020-12-09 08:59:28,234 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 08:59:28,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=360, Invalid=1882, Unknown=14, NotChecked=0, Total=2256 [2020-12-09 08:59:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 08:59:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-09 08:59:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 08:59:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2020-12-09 08:59:28,236 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 42 [2020-12-09 08:59:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:59:28,236 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2020-12-09 08:59:28,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-09 08:59:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2020-12-09 08:59:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-09 08:59:28,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:59:28,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:59:28,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1313 [2020-12-09 08:59:28,438 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-12-09 08:59:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:59:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1878126781, now seen corresponding path program 1 times [2020-12-09 08:59:28,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:59:28,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612697394] [2020-12-09 08:59:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:59:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:59:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:59:29,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612697394] [2020-12-09 08:59:29,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826534861] [2020-12-09 08:59:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:59:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:59:29,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 74 conjunts are in the unsatisfiable core [2020-12-09 08:59:29,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:59:29,627 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-12-09 08:59:29,804 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2020-12-09 08:59:30,300 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2020-12-09 08:59:30,655 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-09 08:59:31,024 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-12-09 08:59:31,264 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-09 08:59:31,672 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-09 08:59:31,998 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-09 08:59:32,524 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-12-09 08:59:32,711 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-12-09 08:59:32,868 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-09 08:59:33,022 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-09 08:59:33,293 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-09 08:59:33,544 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-09 08:59:33,722 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-09 08:59:33,924 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-09 08:59:34,159 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-09 08:59:34,479 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-09 08:59:34,852 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-12-09 08:59:35,206 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-12-09 08:59:35,479 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-09 08:59:35,662 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 08:59:35,871 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-09 08:59:36,259 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-09 08:59:36,543 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-12-09 08:59:37,112 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 125 [2020-12-09 08:59:37,613 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2020-12-09 08:59:38,094 WARN L197 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 114 [2020-12-09 08:59:38,662 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2020-12-09 08:59:38,991 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-09 08:59:39,427 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-12-09 08:59:39,803 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-12-09 08:59:40,158 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-09 08:59:41,562 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-09 08:59:43,132 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2020-12-09 08:59:44,036 WARN L197 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 140 [2020-12-09 08:59:44,978 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-09 08:59:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 08:59:45,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:59:48,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_circular_update_at_~head.offset Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_42)) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_main_~s~0.base 0) |c_ULTIMATE.start_main_old_#valid|))) is different from false [2020-12-09 08:59:50,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int)) (or (= |c_ULTIMATE.start_main_old_#valid| (store (store |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_sll_circular_update_at_~head.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_main_~s~0.base 0)) (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) is different from false [2020-12-09 09:00:16,588 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 09:00:18,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (= (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_43)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_main_~s~0.base 0) |c_ULTIMATE.start_main_old_#valid|) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) is different from false [2020-12-09 09:00:20,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (= |c_ULTIMATE.start_main_old_#valid| (store (store |c_#valid| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4) v_DerPreprocessor_43))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_main_~s~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_main_~s~0.base 0)) (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) is different from false [2020-12-09 09:00:22,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (= |c_ULTIMATE.start_main_old_#valid| (store (store |c_#valid| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ c_ULTIMATE.start_sll_circular_create_~head~0.offset 4) v_DerPreprocessor_43))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_sll_circular_create_~head~0.base 0)) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) is different from false [2020-12-09 09:00:23,887 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (= (store (store |c_#valid| (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) (+ c_ULTIMATE.start_sll_circular_create_~new_head~0.offset 4) v_DerPreprocessor_43))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_sll_circular_create_~new_head~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42))))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_sll_circular_create_~new_head~0.base 0) |c_ULTIMATE.start_main_old_#valid|) (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) is different from false [2020-12-09 09:00:30,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (|#memory_$Pointer$.base| (Array Int (Array Int Int))) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0) (= (store (store |c_#valid| (select (select (let ((.cse3 (let ((.cse4 (store |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (select |#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) c_ULTIMATE.start_node_create_~temp~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (store .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select .cse4 c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_node_create_~temp~0.base))))) (let ((.cse2 (store (select .cse3 c_ULTIMATE.start_node_create_~temp~0.base) (+ c_ULTIMATE.start_node_create_~temp~0.offset 4) v_DerPreprocessor_43))) (let ((.cse0 (store .cse3 c_ULTIMATE.start_node_create_~temp~0.base .cse2)) (.cse1 (select .cse2 c_ULTIMATE.start_node_create_~temp~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42))))) c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_node_create_~temp~0.base 0) |c_ULTIMATE.start_main_old_#valid|))) is different from false [2020-12-09 09:00:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2020-12-09 09:00:33,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [857335182] [2020-12-09 09:00:33,742 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2020-12-09 09:00:33,742 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 09:00:33,742 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 09:00:33,742 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 09:00:33,742 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 09:00:33,823 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:34,057 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:34,094 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:34,103 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:34,449 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:34,572 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:34,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:35,100 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:35,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:35,772 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:35,995 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,244 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,259 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,270 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,672 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,684 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 09:00:36,724 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 09:00:36,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 09:00:36,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 48 [2020-12-09 09:00:36,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413545632] [2020-12-09 09:00:36,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-09 09:00:36,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 09:00:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-09 09:00:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1694, Unknown=19, NotChecked=616, Total=2450 [2020-12-09 09:00:36,726 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 50 states. [2020-12-09 09:00:39,472 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2020-12-09 09:00:39,938 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-12-09 09:00:41,432 WARN L197 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 42 [2020-12-09 09:00:43,542 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) c_ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)) c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (and (let ((.cse10 (select |c_ULTIMATE.start_main_old_#valid| 0))) (let ((.cse3 (= .cse10 0)) (.cse0 (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~last~0.base) 1)) (.cse1 (= (select |c_ULTIMATE.start_main_old_#valid| c_ULTIMATE.start_sll_circular_create_~last~0.base) 0)) (.cse4 (<= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0)) (.cse5 (= c_ULTIMATE.start_sll_circular_create_~last~0.base (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~head~0.base) c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (.cse2 (= c_ULTIMATE.start_sll_circular_create_~head~0.base 0)) (.cse6 (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base c_ULTIMATE.start_sll_circular_create_~last~0.base))) (.cse9 (select |c_#valid| 0)) (.cse7 (<= 0 c_ULTIMATE.start_sll_circular_create_~head~0.offset)) (.cse8 (= (select |c_#valid| c_ULTIMATE.start_sll_circular_create_~head~0.base) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_81 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid| v_prenex_81) 1) (= (select |c_#valid| v_prenex_81) 1))) .cse7 .cse8) (and .cse0 .cse1 .cse4 (exists ((|#t~string0.base| Int)) (and (= (select |c_#valid| |#t~string0.base|) 1) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base |#t~string0.base|)) (= (select |c_ULTIMATE.start_main_old_#valid| |#t~string0.base|) 1))) .cse5 .cse6 (= c_ULTIMATE.start_sll_circular_create_~last~0.base 0) .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= .cse9 0) (exists ((v_prenex_82 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid| v_prenex_82) 1) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base v_prenex_82)) (= (select |c_#valid| v_prenex_82) 1))) .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse5 (not .cse2) .cse6 (= .cse9 1) (= .cse10 1) .cse7 .cse8)))) (forall ((ULTIMATE.start_sll_circular_create_~last~0.offset Int) (v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (= |c_ULTIMATE.start_main_old_#valid| (store (store |c_#valid| (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~head~0.base)))) (let ((.cse13 (store (select .cse14 c_ULTIMATE.start_sll_circular_create_~head~0.base) (+ c_ULTIMATE.start_sll_circular_create_~head~0.offset 4) v_DerPreprocessor_43))) (let ((.cse11 (store .cse14 c_ULTIMATE.start_sll_circular_create_~head~0.base .cse13)) (.cse12 (select .cse13 c_ULTIMATE.start_sll_circular_create_~head~0.offset))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42))))) c_ULTIMATE.start_sll_circular_create_~head~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_sll_circular_create_~head~0.base 0)) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) (not (= c_ULTIMATE.start_sll_circular_create_~head~0.base .cse15)) (= c_ULTIMATE.start_sll_circular_create_~head~0.offset 0) (= (store (store |c_#valid| .cse15 0) c_ULTIMATE.start_sll_circular_create_~head~0.base 0) |c_ULTIMATE.start_main_old_#valid|))) is different from false [2020-12-09 09:00:45,551 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (let ((.cse0 (not (= c_ULTIMATE.start_main_~s~0.base .cse12)))) (and .cse0 (= c_ULTIMATE.start_main_~s~0.offset 0) (let ((.cse4 (= c_ULTIMATE.start_main_~s~0.base 0)) (.cse8 (select |c_#valid| 0)) (.cse11 (select |c_ULTIMATE.start_main_old_#valid| 0))) (let ((.cse1 (= (select |c_ULTIMATE.start_main_old_#valid| .cse12) 0)) (.cse6 (= (select |c_#valid| .cse12) 1)) (.cse2 (<= 0 c_ULTIMATE.start_main_~s~0.offset)) (.cse3 (= .cse11 0)) (.cse5 (<= c_ULTIMATE.start_main_~s~0.offset 0)) (.cse9 (= .cse8 1)) (.cse10 (not .cse4)) (.cse7 (= (select |c_#valid| c_ULTIMATE.start_main_~s~0.base) 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_81 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid| v_prenex_81) 1) (= (select |c_#valid| v_prenex_81) 1))) (exists ((v_prenex_88 Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) v_prenex_88))) .cse0 .cse6 .cse7) (and .cse1 (exists ((v_prenex_82 Int)) (and (not (= c_ULTIMATE.start_main_~s~0.base v_prenex_82)) (= (select |c_ULTIMATE.start_main_old_#valid| v_prenex_82) 1) (= (select |c_#valid| v_prenex_82) 1))) .cse2 .cse3 .cse5 (= .cse8 0) .cse0 .cse6 .cse7 (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset)))) (and .cse1 .cse2 .cse5 .cse9 .cse0 .cse10 (exists ((v_prenex_90 Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) v_prenex_90) c_ULTIMATE.start_main_~s~0.base)) (= .cse11 1) .cse6 .cse7) (and (exists ((|#t~string0.base| Int)) (and (not (= c_ULTIMATE.start_main_~s~0.base |#t~string0.base|)) (= (select |c_#valid| |#t~string0.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid| |#t~string0.base|) 1))) .cse2 .cse3 (exists ((v_prenex_86 Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| 0) v_prenex_86))) .cse5 .cse9 .cse10 (= .cse12 0) .cse7)))) (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (= |c_ULTIMATE.start_main_old_#valid| (store (store |c_#valid| (select (select (let ((.cse15 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4) v_DerPreprocessor_43))) (let ((.cse13 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base .cse15)) (.cse14 (select .cse15 c_ULTIMATE.start_main_~s~0.offset))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_main_~s~0.base 0)) (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) (= (store (store |c_#valid| .cse12 0) c_ULTIMATE.start_main_~s~0.base 0) |c_ULTIMATE.start_main_old_#valid|)))) is different from false [2020-12-09 09:00:47,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_main_~s~0.base c_ULTIMATE.start_sll_circular_update_at_~head.base)) (.cse17 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) c_ULTIMATE.start_main_~s~0.offset))) (and .cse0 (forall ((v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 Int) (ULTIMATE.start_sll_circular_destroy_~head.offset Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_43 Int)) (or (< 0 ULTIMATE.start_sll_circular_destroy_~head.offset) (= (store (store |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_update_at_~head.base) (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) v_DerPreprocessor_43)))) (let ((.cse2 (select (select .cse1 c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ v_ULTIMATE.start_sll_circular_update_at_~head.offset_199 4) v_DerPreprocessor_42)))) c_ULTIMATE.start_main_~s~0.base) ULTIMATE.start_sll_circular_destroy_~head.offset) 0) c_ULTIMATE.start_main_~s~0.base 0) |c_ULTIMATE.start_main_old_#valid|) (< ULTIMATE.start_sll_circular_destroy_~head.offset 0))) (let ((.cse15 (select |c_ULTIMATE.start_main_old_#valid| 0)) (.cse14 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) (.cse16 (= c_ULTIMATE.start_main_~s~0.base 0)) (.cse8 (select |c_#valid| 0))) (let ((.cse12 (= .cse8 1)) (.cse13 (not .cse16)) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid| .cse14) 0)) (.cse4 (<= 0 c_ULTIMATE.start_main_~s~0.offset)) (.cse5 (= .cse15 0)) (.cse6 (= c_ULTIMATE.start_sll_circular_update_at_~head.offset c_ULTIMATE.start_main_~s~0.offset)) (.cse7 (<= c_ULTIMATE.start_main_~s~0.offset 0)) (.cse9 (not (= c_ULTIMATE.start_main_~s~0.base .cse14))) (.cse10 (= (select |c_#valid| .cse14) 1)) (.cse11 (= (select |c_#valid| c_ULTIMATE.start_main_~s~0.base) 1))) (or (and .cse0 .cse3 (exists ((v_prenex_82 Int)) (and (not (= c_ULTIMATE.start_main_~s~0.base v_prenex_82)) (= (select |c_ULTIMATE.start_main_old_#valid| v_prenex_82) 1) (= (select |c_#valid| v_prenex_82) 1))) .cse4 .cse5 .cse6 .cse7 (= .cse8 0) .cse9 .cse10 .cse11 (exists ((ULTIMATE.start_sll_circular_create_~last~0.offset Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) ULTIMATE.start_sll_circular_create_~last~0.offset)))) (and .cse0 (exists ((|#t~string0.base| Int)) (and (not (= c_ULTIMATE.start_main_~s~0.base |#t~string0.base|)) (= (select |c_#valid| |#t~string0.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid| |#t~string0.base|) 1))) .cse4 .cse5 .cse6 (exists ((v_prenex_86 Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| 0) v_prenex_86))) .cse7 .cse12 .cse13 (= .cse14 0) .cse11) (and .cse0 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9 .cse13 (exists ((v_prenex_90 Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) v_prenex_90) c_ULTIMATE.start_main_~s~0.base)) (= .cse15 1) .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 (exists ((v_prenex_81 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid| v_prenex_81) 1) (= (select |c_#valid| v_prenex_81) 1))) (exists ((v_prenex_88 Int)) (= c_ULTIMATE.start_main_~s~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)) v_prenex_88))) .cse9 .cse10 .cse11)))) (= (store (store |c_#valid| .cse17 0) c_ULTIMATE.start_main_~s~0.base 0) |c_ULTIMATE.start_main_old_#valid|) (not (= (+ c_ULTIMATE.start_sll_circular_update_at_~head.offset 4) c_ULTIMATE.start_main_~s~0.offset)) (not (= .cse17 c_ULTIMATE.start_main_~s~0.base)))) is different from false [2020-12-09 09:00:48,219 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2020-12-09 09:00:55,704 WARN L197 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2020-12-09 09:00:56,702 WARN L197 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 71 [2020-12-09 09:00:59,308 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2020-12-09 09:00:59,866 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2020-12-09 09:01:01,481 WARN L197 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2020-12-09 09:01:03,585 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 210 DAG size of output: 106 [2020-12-09 09:01:06,127 WARN L197 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 171 DAG size of output: 62 [2020-12-09 09:01:08,258 WARN L197 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 176 DAG size of output: 67 [2020-12-09 09:01:10,677 WARN L197 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-12-09 09:01:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:01:10,678 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-12-09 09:01:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 09:01:10,678 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 44 [2020-12-09 09:01:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:01:10,679 INFO L225 Difference]: With dead ends: 44 [2020-12-09 09:01:10,679 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 09:01:10,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=283, Invalid=2926, Unknown=23, NotChecked=1190, Total=4422 [2020-12-09 09:01:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 09:01:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 09:01:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 09:01:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 09:01:10,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2020-12-09 09:01:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:01:10,681 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 09:01:10,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-09 09:01:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 09:01:10,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 09:01:10,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1394,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 09:01:10,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:01:10 BoogieIcfgContainer [2020-12-09 09:01:10,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 09:01:10,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 09:01:10,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 09:01:10,895 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 09:01:10,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:47:55" (3/4) ... [2020-12-09 09:01:10,903 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 09:01:10,924 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2020-12-09 09:01:10,924 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-12-09 09:01:10,925 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 09:01:10,925 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 09:01:10,956 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_feeedbf9-9b27-4cfc-a16f-780ff740f66a/bin/utaipan/witness.graphml [2020-12-09 09:01:10,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 09:01:10,956 INFO L168 Benchmark]: Toolchain (without parser) took 796023.98 ms. Allocated memory was 115.3 MB in the beginning and 302.0 MB in the end (delta: 186.6 MB). Free memory was 91.2 MB in the beginning and 83.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 195.4 MB. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 115.3 MB. Free memory is still 79.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.72 ms. Allocated memory is still 115.3 MB. Free memory was 91.0 MB in the beginning and 78.2 MB in the end (delta: 12.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.90 ms. Allocated memory is still 115.3 MB. Free memory was 78.2 MB in the beginning and 76.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: Boogie Preprocessor took 23.41 ms. Allocated memory is still 115.3 MB. Free memory was 76.1 MB in the beginning and 74.3 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: RCFGBuilder took 507.63 ms. Allocated memory is still 115.3 MB. Free memory was 74.3 MB in the beginning and 71.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: TraceAbstraction took 795044.75 ms. Allocated memory was 115.3 MB in the beginning and 302.0 MB in the end (delta: 186.6 MB). Free memory was 71.4 MB in the beginning and 87.0 MB in the end (delta: -15.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 16.1 GB. [2020-12-09 09:01:10,956 INFO L168 Benchmark]: Witness Printer took 61.51 ms. Allocated memory is still 302.0 MB. Free memory was 87.0 MB in the beginning and 83.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:01:10,957 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.16 ms. Allocated memory is still 115.3 MB. Free memory is still 79.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 338.72 ms. Allocated memory is still 115.3 MB. Free memory was 91.0 MB in the beginning and 78.2 MB in the end (delta: 12.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.90 ms. Allocated memory is still 115.3 MB. Free memory was 78.2 MB in the beginning and 76.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.41 ms. Allocated memory is still 115.3 MB. Free memory was 76.1 MB in the beginning and 74.3 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 507.63 ms. Allocated memory is still 115.3 MB. Free memory was 74.3 MB in the beginning and 71.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 795044.75 ms. Allocated memory was 115.3 MB in the beginning and 302.0 MB in the end (delta: 186.6 MB). Free memory was 71.4 MB in the beginning and 87.0 MB in the end (delta: -15.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 16.1 GB. * Witness Printer took 61.51 ms. Allocated memory is still 302.0 MB. Free memory was 87.0 MB in the beginning and 83.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 618]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 32 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 794.9s, OverallIterations: 37, TraceHistogramMax: 3, AutomataDifference: 223.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1303 SDtfs, 8642 SDslu, 6456 SDs, 0 SdLazy, 8844 SolverSat, 955 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 40.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1695 GetRequests, 805 SyntacticMatches, 56 SemanticMatches, 834 ConstructedPredicates, 52 IntricatePredicates, 2 DeprecatedPredicates, 6275 ImplicationChecksByTransitivity, 659.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 915 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 512.2s InterpolantComputationTime, 1463 NumberOfCodeBlocks, 1463 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1966 ConstructedInterpolants, 385 QuantifiedInterpolants, 2504410 SizeOfPredicates, 491 NumberOfNonLiveVariables, 5339 ConjunctsInSsa, 920 ConjunctsInUnsatCore, 75 InterpolantComputations, 20 PerfectInterpolantSequences, 480/809 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: OVERALL_TIME[ms]: 2294, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 13, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 26, TOOLS_POST_TIME[ms]: 1714, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 25, TOOLS_QUANTIFIERELIM_TIME[ms]: 1703, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 200, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 48, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME[ms]: 321, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 155, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME[ms]: 8, DOMAIN_ISBOTTOM_APPLICATIONS: 13, DOMAIN_ISBOTTOM_TIME[ms]: 52, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 892, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 891, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 3, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 10, DAG_COMPRESSION_PROCESSED_NODES: 259, DAG_COMPRESSION_RETAINED_NODES: 51, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...