./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/bigshot_s.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/bigshot_s.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW --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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:47:12,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:47:12,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:47:12,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:47:12,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:47:12,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:47:12,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:47:12,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:47:12,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:47:12,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:47:12,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:47:12,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:47:12,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:47:12,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:47:12,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:47:12,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:47:12,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:47:12,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:47:12,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:47:12,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:47:12,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:47:12,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:47:12,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:47:12,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:47:12,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:47:12,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:47:12,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:47:12,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:47:12,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:47:12,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:47:12,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:47:13,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:47:13,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:47:13,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:47:13,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:47:13,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:47:13,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:47:13,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:47:13,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:47:13,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:47:13,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:47:13,008 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 13:47:13,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:47:13,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:47:13,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:47:13,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:47:13,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:47:13,036 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:47:13,036 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:47:13,037 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:47:13,037 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:47:13,037 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:47:13,038 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:47:13,038 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:47:13,038 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:47:13,039 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:47:13,039 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:47:13,039 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:47:13,040 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:47:13,040 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:47:13,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:47:13,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:47:13,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:47:13,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:47:13,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:47:13,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:47:13,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:47:13,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:47:13,044 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:47:13,044 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:47:13,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 13:47:13,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:47:13,045 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:47:13,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:47:13,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:47:13,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:47:13,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:47:13,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:47:13,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:47:13,048 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:47:13,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:47:13,048 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:47:13,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:47:13,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:47:13,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2022-11-23 13:47:13,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:47:13,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:47:13,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:47:13,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:47:13,417 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:47:13,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread/bigshot_s.i [2022-11-23 13:47:16,828 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:47:17,195 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:47:17,199 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/sv-benchmarks/c/pthread/bigshot_s.i [2022-11-23 13:47:17,222 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data/d20d25ad0/61278ecf234f4f5aa3a501681b432de7/FLAG639b6650e [2022-11-23 13:47:17,243 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data/d20d25ad0/61278ecf234f4f5aa3a501681b432de7 [2022-11-23 13:47:17,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:47:17,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:47:17,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:47:17,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:47:17,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:47:17,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:47:17" (1/1) ... [2022-11-23 13:47:17,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a87fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:17, skipping insertion in model container [2022-11-23 13:47:17,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:47:17" (1/1) ... [2022-11-23 13:47:17,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:47:17,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:47:18,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-23 13:47:18,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:47:18,264 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:47:18,331 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-23 13:47:18,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:47:18,419 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:47:18,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18 WrapperNode [2022-11-23 13:47:18,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:47:18,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:47:18,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:47:18,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:47:18,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,519 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-23 13:47:18,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:47:18,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:47:18,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:47:18,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:47:18,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:47:18,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:47:18,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:47:18,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:47:18,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (1/1) ... [2022-11-23 13:47:18,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:47:18,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:18,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:47:18,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:47:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:47:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:47:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-23 13:47:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 13:47:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 13:47:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 13:47:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 13:47:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 13:47:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:47:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 13:47:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:47:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:47:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:47:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:47:18,689 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:47:18,894 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:47:18,897 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:47:19,312 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:47:19,320 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:47:19,321 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 13:47:19,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:19 BoogieIcfgContainer [2022-11-23 13:47:19,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:47:19,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:47:19,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:47:19,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:47:19,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:47:17" (1/3) ... [2022-11-23 13:47:19,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea8f826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:47:19, skipping insertion in model container [2022-11-23 13:47:19,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:18" (2/3) ... [2022-11-23 13:47:19,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea8f826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:47:19, skipping insertion in model container [2022-11-23 13:47:19,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:19" (3/3) ... [2022-11-23 13:47:19,343 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2022-11-23 13:47:19,366 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:47:19,367 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 13:47:19,369 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:47:19,587 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 13:47:19,643 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:47:19,666 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 119 transitions, 254 flow [2022-11-23 13:47:19,672 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 119 transitions, 254 flow [2022-11-23 13:47:19,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 119 transitions, 254 flow [2022-11-23 13:47:19,784 INFO L130 PetriNetUnfolder]: 5/117 cut-off events. [2022-11-23 13:47:19,785 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 13:47:19,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 5/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-23 13:47:19,795 INFO L119 LiptonReduction]: Number of co-enabled transitions 360 [2022-11-23 13:47:27,014 INFO L134 LiptonReduction]: Checked pairs total: 485 [2022-11-23 13:47:27,015 INFO L136 LiptonReduction]: Total number of compositions: 134 [2022-11-23 13:47:27,025 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 34 transitions, 84 flow [2022-11-23 13:47:27,042 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:47:27,072 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78a8d73e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:47:27,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-23 13:47:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 13:47:27,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:27,082 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 13:47:27,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:27,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash 461, now seen corresponding path program 1 times [2022-11-23 13:47:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:27,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087412430] [2022-11-23 13:47:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:27,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:27,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087412430] [2022-11-23 13:47:27,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087412430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:27,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:27,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 13:47:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955402929] [2022-11-23 13:47:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:27,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:47:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:27,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:47:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:47:27,266 INFO L87 Difference]: Start difference. First operand has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:27,353 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2022-11-23 13:47:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:47:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-23 13:47:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:27,369 INFO L225 Difference]: With dead ends: 47 [2022-11-23 13:47:27,369 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 13:47:27,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:47:27,379 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:27,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 13:47:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-23 13:47:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 3.0) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 75 transitions. [2022-11-23 13:47:27,430 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 75 transitions. Word has length 1 [2022-11-23 13:47:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:27,432 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 75 transitions. [2022-11-23 13:47:27,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 75 transitions. [2022-11-23 13:47:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 13:47:27,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:27,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 13:47:27,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:47:27,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 454524, now seen corresponding path program 1 times [2022-11-23 13:47:27,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:27,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342737138] [2022-11-23 13:47:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:27,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342737138] [2022-11-23 13:47:27,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342737138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:27,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:27,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:47:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742659462] [2022-11-23 13:47:27,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:27,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:47:27,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:27,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:47:27,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:47:27,808 INFO L87 Difference]: Start difference. First operand 47 states and 75 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:27,860 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2022-11-23 13:47:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:47:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 13:47:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:27,862 INFO L225 Difference]: With dead ends: 45 [2022-11-23 13:47:27,863 INFO L226 Difference]: Without dead ends: 45 [2022-11-23 13:47:27,863 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:47:27,864 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:27,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:47:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-23 13:47:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-23 13:47:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 3.0) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-11-23 13:47:27,872 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 3 [2022-11-23 13:47:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:27,873 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-11-23 13:47:27,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-11-23 13:47:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 13:47:27,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:27,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 13:47:27,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:47:27,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash 454525, now seen corresponding path program 1 times [2022-11-23 13:47:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:27,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446353386] [2022-11-23 13:47:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:27,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446353386] [2022-11-23 13:47:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446353386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:27,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:47:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435370911] [2022-11-23 13:47:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:27,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:47:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:47:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:47:27,947 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:28,057 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2022-11-23 13:47:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:47:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 13:47:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:28,064 INFO L225 Difference]: With dead ends: 81 [2022-11-23 13:47:28,064 INFO L226 Difference]: Without dead ends: 81 [2022-11-23 13:47:28,066 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:47:28,070 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:28,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-23 13:47:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2022-11-23 13:47:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 43 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-11-23 13:47:28,087 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 3 [2022-11-23 13:47:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:28,087 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-11-23 13:47:28,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-11-23 13:47:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 13:47:28,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:28,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 13:47:28,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:47:28,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash 14091797, now seen corresponding path program 1 times [2022-11-23 13:47:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:28,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724434494] [2022-11-23 13:47:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:28,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:28,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:28,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724434494] [2022-11-23 13:47:28,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724434494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:28,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:28,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:47:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71217392] [2022-11-23 13:47:28,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:47:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:47:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:47:28,351 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:28,434 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-11-23 13:47:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:47:28,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-23 13:47:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:28,436 INFO L225 Difference]: With dead ends: 43 [2022-11-23 13:47:28,437 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 13:47:28,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:47:28,438 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:28,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 13:47:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-23 13:47:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 3.0) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-11-23 13:47:28,444 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 4 [2022-11-23 13:47:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:28,444 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2022-11-23 13:47:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-11-23 13:47:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 13:47:28,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:28,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 13:47:28,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:47:28,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash 656198352, now seen corresponding path program 1 times [2022-11-23 13:47:28,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:28,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494517174] [2022-11-23 13:47:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:28,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:28,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494517174] [2022-11-23 13:47:28,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494517174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:28,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:28,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:47:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458887983] [2022-11-23 13:47:28,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:28,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:47:28,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:47:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:47:28,674 INFO L87 Difference]: Start difference. First operand 43 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:28,730 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2022-11-23 13:47:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:47:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 13:47:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:28,732 INFO L225 Difference]: With dead ends: 35 [2022-11-23 13:47:28,732 INFO L226 Difference]: Without dead ends: 35 [2022-11-23 13:47:28,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:47:28,734 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:28,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:47:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-23 13:47:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-23 13:47:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2022-11-23 13:47:28,748 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 6 [2022-11-23 13:47:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:28,749 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-11-23 13:47:28,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2022-11-23 13:47:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 13:47:28,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:28,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 13:47:28,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:47:28,751 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash 656198354, now seen corresponding path program 1 times [2022-11-23 13:47:28,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:28,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454035318] [2022-11-23 13:47:28,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:28,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:28,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454035318] [2022-11-23 13:47:28,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454035318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:28,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:28,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:47:28,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658662897] [2022-11-23 13:47:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:28,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:47:28,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:28,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:47:28,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:47:28,918 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:28,967 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-11-23 13:47:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:47:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 13:47:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:28,973 INFO L225 Difference]: With dead ends: 27 [2022-11-23 13:47:28,973 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 13:47:28,973 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:47:28,981 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:28,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:47:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 13:47:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 13:47:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-23 13:47:28,986 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 6 [2022-11-23 13:47:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:28,987 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-23 13:47:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-11-23 13:47:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:47:28,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:28,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:28,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:47:28,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1885700721, now seen corresponding path program 1 times [2022-11-23 13:47:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:28,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630725645] [2022-11-23 13:47:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:29,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:29,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630725645] [2022-11-23 13:47:29,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630725645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:29,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:29,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:47:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136906246] [2022-11-23 13:47:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:29,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:47:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:47:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:47:29,325 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:29,454 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-11-23 13:47:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:47:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:47:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:29,455 INFO L225 Difference]: With dead ends: 31 [2022-11-23 13:47:29,455 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 13:47:29,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:47:29,457 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:29,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 13:47:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-23 13:47:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-23 13:47:29,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2022-11-23 13:47:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:29,469 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-23 13:47:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-23 13:47:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:47:29,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:29,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:29,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:47:29,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1885700605, now seen corresponding path program 1 times [2022-11-23 13:47:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:29,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740619039] [2022-11-23 13:47:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:29,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:29,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740619039] [2022-11-23 13:47:29,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740619039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:29,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:29,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:47:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636160813] [2022-11-23 13:47:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:29,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:47:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:29,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:47:29,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:47:29,662 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:29,754 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2022-11-23 13:47:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:47:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:47:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:29,755 INFO L225 Difference]: With dead ends: 36 [2022-11-23 13:47:29,755 INFO L226 Difference]: Without dead ends: 36 [2022-11-23 13:47:29,756 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:47:29,759 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:29,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-23 13:47:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2022-11-23 13:47:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 2.1) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2022-11-23 13:47:29,765 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 9 [2022-11-23 13:47:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:29,765 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. [2022-11-23 13:47:29,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. [2022-11-23 13:47:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:47:29,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:29,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:29,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:47:29,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1885700604, now seen corresponding path program 1 times [2022-11-23 13:47:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:29,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825841628] [2022-11-23 13:47:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:29,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825841628] [2022-11-23 13:47:29,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825841628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:29,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:29,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:47:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743542635] [2022-11-23 13:47:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:29,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:47:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:47:29,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:47:29,887 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:29,955 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2022-11-23 13:47:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:47:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:47:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:29,957 INFO L225 Difference]: With dead ends: 27 [2022-11-23 13:47:29,957 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 13:47:29,958 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:47:29,960 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:29,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 13:47:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-23 13:47:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.894736842105263) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2022-11-23 13:47:29,964 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 9 [2022-11-23 13:47:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:29,965 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. [2022-11-23 13:47:29,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2022-11-23 13:47:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:47:29,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:29,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:29,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:47:29,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1885700678, now seen corresponding path program 1 times [2022-11-23 13:47:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:29,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311717456] [2022-11-23 13:47:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:30,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:30,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311717456] [2022-11-23 13:47:30,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311717456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:30,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:30,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:47:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104363703] [2022-11-23 13:47:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:30,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:47:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:47:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:47:30,503 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:30,728 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-11-23 13:47:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:47:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:47:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:30,728 INFO L225 Difference]: With dead ends: 28 [2022-11-23 13:47:30,729 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 13:47:30,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:47:30,730 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:30,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 13:47:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-11-23 13:47:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2022-11-23 13:47:30,732 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 9 [2022-11-23 13:47:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:30,733 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-11-23 13:47:30,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-11-23 13:47:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:47:30,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:30,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:30,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:47:30,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1672824740, now seen corresponding path program 1 times [2022-11-23 13:47:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:30,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744299727] [2022-11-23 13:47:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:30,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744299727] [2022-11-23 13:47:30,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744299727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:30,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082199913] [2022-11-23 13:47:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:30,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:30,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:30,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:47:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:31,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 13:47:31,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:31,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:47:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:31,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:31,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082199913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:31,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474922350] [2022-11-23 13:47:31,364 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:31,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:31,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-23 13:47:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982324105] [2022-11-23 13:47:31,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:31,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 13:47:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 13:47:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:47:31,382 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:31,641 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-11-23 13:47:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:47:31,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 13:47:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:31,643 INFO L225 Difference]: With dead ends: 55 [2022-11-23 13:47:31,643 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 13:47:31,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:47:31,644 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:31,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:47:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 13:47:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. [2022-11-23 13:47:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 2.2) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2022-11-23 13:47:31,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 10 [2022-11-23 13:47:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:31,648 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2022-11-23 13:47:31,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2022-11-23 13:47:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:47:31,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:31,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:31,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 13:47:31,858 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1672824667, now seen corresponding path program 1 times [2022-11-23 13:47:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295158919] [2022-11-23 13:47:31,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:32,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295158919] [2022-11-23 13:47:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295158919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210776086] [2022-11-23 13:47:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:32,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:32,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:47:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:32,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 13:47:32,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:32,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:32,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:32,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:32,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 13:47:32,594 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:32,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:32,718 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:47:32,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 13:47:32,749 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 13:47:32,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:47:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:32,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210776086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132043222] [2022-11-23 13:47:33,021 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:33,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:33,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-11-23 13:47:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273179557] [2022-11-23 13:47:33,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:47:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:47:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:47:33,026 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:34,006 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-11-23 13:47:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:47:34,006 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 13:47:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:34,007 INFO L225 Difference]: With dead ends: 49 [2022-11-23 13:47:34,007 INFO L226 Difference]: Without dead ends: 49 [2022-11-23 13:47:34,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2022-11-23 13:47:34,008 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:34,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:47:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-23 13:47:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2022-11-23 13:47:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.96) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2022-11-23 13:47:34,011 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 10 [2022-11-23 13:47:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:34,012 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2022-11-23 13:47:34,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2022-11-23 13:47:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 13:47:34,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:34,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:34,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:34,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:34,222 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash 317440932, now seen corresponding path program 1 times [2022-11-23 13:47:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:34,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836492802] [2022-11-23 13:47:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:34,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:34,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836492802] [2022-11-23 13:47:34,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836492802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:34,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:34,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:47:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343596348] [2022-11-23 13:47:34,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:34,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:47:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:47:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:47:34,270 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:34,304 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2022-11-23 13:47:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:47:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 13:47:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:34,306 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:47:34,307 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 13:47:34,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:47:34,308 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:34,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:47:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 13:47:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 13:47:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.88) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2022-11-23 13:47:34,316 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 11 [2022-11-23 13:47:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:34,316 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2022-11-23 13:47:34,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2022-11-23 13:47:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:47:34,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:34,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:34,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 13:47:34,320 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1267164009, now seen corresponding path program 1 times [2022-11-23 13:47:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:34,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014104503] [2022-11-23 13:47:34,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:34,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:34,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014104503] [2022-11-23 13:47:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014104503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:34,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:47:34,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:47:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688459185] [2022-11-23 13:47:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:34,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:47:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:47:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:47:34,772 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:34,927 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. [2022-11-23 13:47:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:47:34,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:47:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:34,928 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:47:34,928 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 13:47:34,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:47:34,929 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:34,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 13:47:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 13:47:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.8) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2022-11-23 13:47:34,931 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 12 [2022-11-23 13:47:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:34,932 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2022-11-23 13:47:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2022-11-23 13:47:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:47:34,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:34,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:34,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 13:47:34,933 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash 617949736, now seen corresponding path program 1 times [2022-11-23 13:47:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:34,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051392076] [2022-11-23 13:47:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:34,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:35,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:35,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051392076] [2022-11-23 13:47:35,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051392076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:35,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624762786] [2022-11-23 13:47:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:35,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:35,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:35,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:35,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:47:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:35,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 13:47:35,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:35,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:35,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:35,596 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 13:47:35,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:47:35,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:35,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:47:35,771 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 13:47:35,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-23 13:47:35,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:35,833 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 13:47:35,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 13:47:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:35,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:36,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624762786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057692619] [2022-11-23 13:47:36,174 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:36,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:36,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 16 [2022-11-23 13:47:36,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473435460] [2022-11-23 13:47:36,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:36,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:47:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:47:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:47:36,179 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:36,541 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2022-11-23 13:47:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:47:36,542 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:47:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:36,542 INFO L225 Difference]: With dead ends: 28 [2022-11-23 13:47:36,542 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 13:47:36,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:47:36,543 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:36,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:47:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 13:47:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-23 13:47:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.68) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-11-23 13:47:36,546 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 13 [2022-11-23 13:47:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:36,546 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-23 13:47:36,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2022-11-23 13:47:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:47:36,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:36,547 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:36,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:36,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 13:47:36,748 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash 617635395, now seen corresponding path program 2 times [2022-11-23 13:47:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:36,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320177822] [2022-11-23 13:47:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:37,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320177822] [2022-11-23 13:47:37,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320177822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:37,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640606272] [2022-11-23 13:47:37,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:47:37,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:37,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:37,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:47:37,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 13:47:37,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:47:37,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 13:47:37,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:37,250 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-23 13:47:37,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 34 [2022-11-23 13:47:37,290 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 13:47:37,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-23 13:47:37,488 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-23 13:47:37,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 43 [2022-11-23 13:47:37,522 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:47:37,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2022-11-23 13:47:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 13:47:37,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:47:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640606272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:47:37,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:47:37,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2022-11-23 13:47:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875797800] [2022-11-23 13:47:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:47:37,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:47:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:47:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:47:37,933 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:38,191 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. [2022-11-23 13:47:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:47:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:47:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:38,192 INFO L225 Difference]: With dead ends: 26 [2022-11-23 13:47:38,192 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 13:47:38,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:47:38,193 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:38,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:47:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 13:47:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-23 13:47:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2022-11-23 13:47:38,195 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 13 [2022-11-23 13:47:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:38,196 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 39 transitions. [2022-11-23 13:47:38,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2022-11-23 13:47:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:47:38,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:38,196 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:38,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:38,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 13:47:38,405 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 617635322, now seen corresponding path program 2 times [2022-11-23 13:47:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:38,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738535750] [2022-11-23 13:47:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:38,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:38,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738535750] [2022-11-23 13:47:38,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738535750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:38,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350329995] [2022-11-23 13:47:38,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:47:38,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:38,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:38,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:38,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:47:39,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:47:39,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:47:39,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 13:47:39,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:39,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:39,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:39,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:39,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 13:47:39,158 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:39,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:39,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:39,292 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:47:39,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 13:47:39,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:47:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:39,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:40,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350329995] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:40,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1936652499] [2022-11-23 13:47:40,109 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:40,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:40,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-11-23 13:47:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058869908] [2022-11-23 13:47:40,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:40,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 13:47:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:40,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 13:47:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:47:40,113 INFO L87 Difference]: Start difference. First operand 26 states and 39 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:41,725 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-11-23 13:47:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 13:47:41,725 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:47:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:41,726 INFO L225 Difference]: With dead ends: 54 [2022-11-23 13:47:41,726 INFO L226 Difference]: Without dead ends: 54 [2022-11-23 13:47:41,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=361, Invalid=1199, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 13:47:41,727 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:41,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:47:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-23 13:47:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2022-11-23 13:47:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2022-11-23 13:47:41,739 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 13 [2022-11-23 13:47:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:41,739 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2022-11-23 13:47:41,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2022-11-23 13:47:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:47:41,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:41,743 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:41,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:41,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 13:47:41,944 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1967143760, now seen corresponding path program 1 times [2022-11-23 13:47:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:41,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964597485] [2022-11-23 13:47:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:42,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964597485] [2022-11-23 13:47:42,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964597485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:42,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239659730] [2022-11-23 13:47:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:42,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:42,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:42,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:47:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:42,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 13:47:42,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:42,649 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:42,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:42,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:42,759 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 13:47:42,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:47:42,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:42,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:42,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:42,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239659730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [573901553] [2022-11-23 13:47:43,264 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:43,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:43,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-11-23 13:47:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321642096] [2022-11-23 13:47:43,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:43,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:47:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:47:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=283, Unknown=8, NotChecked=0, Total=342 [2022-11-23 13:47:43,267 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:43,696 INFO L93 Difference]: Finished difference Result 34 states and 57 transitions. [2022-11-23 13:47:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:47:43,697 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:47:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:43,697 INFO L225 Difference]: With dead ends: 34 [2022-11-23 13:47:43,697 INFO L226 Difference]: Without dead ends: 34 [2022-11-23 13:47:43,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=395, Unknown=8, NotChecked=0, Total=506 [2022-11-23 13:47:43,698 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:43,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:47:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-23 13:47:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-23 13:47:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.78125) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2022-11-23 13:47:43,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 14 [2022-11-23 13:47:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:43,701 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2022-11-23 13:47:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2022-11-23 13:47:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:47:43,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:43,702 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:43,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:43,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 13:47:43,911 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 842485327, now seen corresponding path program 2 times [2022-11-23 13:47:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:43,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764747299] [2022-11-23 13:47:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:44,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:44,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764747299] [2022-11-23 13:47:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764747299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838084450] [2022-11-23 13:47:44,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:47:44,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:44,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:44,547 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:44,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:47:44,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:47:44,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:47:44,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 13:47:44,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:44,768 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:44,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:44,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:44,861 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:47:44,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 13:47:44,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:45,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:45,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:45,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:45,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:45,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_388) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-23 13:47:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-23 13:47:45,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838084450] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:45,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [729514474] [2022-11-23 13:47:45,478 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:45,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:45,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-11-23 13:47:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904696892] [2022-11-23 13:47:45,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:45,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 13:47:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 13:47:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=361, Unknown=7, NotChecked=38, Total=462 [2022-11-23 13:47:45,485 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:46,442 INFO L93 Difference]: Finished difference Result 38 states and 60 transitions. [2022-11-23 13:47:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:47:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 13:47:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:46,443 INFO L225 Difference]: With dead ends: 38 [2022-11-23 13:47:46,444 INFO L226 Difference]: Without dead ends: 38 [2022-11-23 13:47:46,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=693, Unknown=7, NotChecked=56, Total=930 [2022-11-23 13:47:46,445 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 33 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:46,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 175 Invalid, 7 Unknown, 22 Unchecked, 0.3s Time] [2022-11-23 13:47:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-23 13:47:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-11-23 13:47:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 55 transitions. [2022-11-23 13:47:46,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 55 transitions. Word has length 15 [2022-11-23 13:47:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:46,448 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 55 transitions. [2022-11-23 13:47:46,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 55 transitions. [2022-11-23 13:47:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:47:46,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:46,448 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:46,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:46,649 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 337812272, now seen corresponding path program 3 times [2022-11-23 13:47:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310610858] [2022-11-23 13:47:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:47,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:47,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310610858] [2022-11-23 13:47:47,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310610858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246296137] [2022-11-23 13:47:47,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:47:47,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:47,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:48,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:47:48,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:47:48,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:47:48,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 13:47:48,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:48,221 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:48,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:48,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:48,385 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 13:47:48,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:47:48,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:48,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:48,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:48,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:48,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:48,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:48,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_443) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2022-11-23 13:47:48,901 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_443) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-23 13:47:48,911 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_443) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2022-11-23 13:47:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-23 13:47:49,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246296137] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1089633080] [2022-11-23 13:47:49,246 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:49,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:49,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-11-23 13:47:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768359350] [2022-11-23 13:47:49,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:49,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 13:47:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 13:47:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=535, Unknown=11, NotChecked=144, Total=756 [2022-11-23 13:47:49,250 INFO L87 Difference]: Start difference. First operand 34 states and 55 transitions. Second operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:49,783 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 1)) (.cse0 (= 3 |c_ULTIMATE.start_main_~#t2~0#1.base|))) (and (forall ((v_~v~0.base_84 Int)) (or (not (= (select |c_#valid| v_~v~0.base_84) 0)) (not (< v_~v~0.base_84 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) v_~v~0.base_84 v_ArrVal_443) 3) 4))))) (<= 104 (select (select |c_#memory_int| 3) 4)) (forall ((v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| c_~v~0.base v_ArrVal_443) 3) 4))) (not (= c_~v~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (not .cse0) (<= (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3))) (forall ((v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_443) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) .cse1 (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base| 3) (or (and .cse1 (= (select (select |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) 4) 104) (not (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|))) .cse0) (not (= 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|)) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_443 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) c_~v~0.base v_ArrVal_443) 3) 4))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| 3)) (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 0))) is different from false [2022-11-23 13:47:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:51,430 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2022-11-23 13:47:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:47:51,431 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 13:47:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:51,432 INFO L225 Difference]: With dead ends: 45 [2022-11-23 13:47:51,432 INFO L226 Difference]: Without dead ends: 45 [2022-11-23 13:47:51,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=194, Invalid=1069, Unknown=13, NotChecked=284, Total=1560 [2022-11-23 13:47:51,435 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 54 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:51,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 343 Invalid, 43 Unknown, 82 Unchecked, 0.6s Time] [2022-11-23 13:47:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-23 13:47:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-11-23 13:47:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-11-23 13:47:51,438 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 16 [2022-11-23 13:47:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:51,438 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-11-23 13:47:51,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-11-23 13:47:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:47:51,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:51,440 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:51,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-23 13:47:51,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:51,647 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1690406840, now seen corresponding path program 4 times [2022-11-23 13:47:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094697891] [2022-11-23 13:47:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:52,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:52,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094697891] [2022-11-23 13:47:52,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094697891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:52,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149074993] [2022-11-23 13:47:52,860 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:47:52,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:52,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:52,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:52,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 13:47:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:53,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 13:47:53,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:53,086 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:53,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:53,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:53,216 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 13:47:53,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:47:53,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:53,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:53,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:53,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:53,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:53,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:53,634 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_498) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2022-11-23 13:47:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-23 13:47:53,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149074993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409256827] [2022-11-23 13:47:53,999 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:54,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:54,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-11-23 13:47:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192249742] [2022-11-23 13:47:54,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:54,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 13:47:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 13:47:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=529, Unknown=15, NotChecked=46, Total=650 [2022-11-23 13:47:54,002 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:55,072 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2022-11-23 13:47:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:47:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 13:47:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:55,073 INFO L225 Difference]: With dead ends: 38 [2022-11-23 13:47:55,073 INFO L226 Difference]: Without dead ends: 38 [2022-11-23 13:47:55,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=151, Invalid=830, Unknown=15, NotChecked=60, Total=1056 [2022-11-23 13:47:55,075 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:55,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 332 Invalid, 0 Unknown, 19 Unchecked, 0.4s Time] [2022-11-23 13:47:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-23 13:47:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-11-23 13:47:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2022-11-23 13:47:55,078 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 53 transitions. Word has length 16 [2022-11-23 13:47:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:55,078 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 53 transitions. [2022-11-23 13:47:55,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. [2022-11-23 13:47:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:47:55,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:55,080 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:55,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:47:55,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:55,286 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:47:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:47:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1872816751, now seen corresponding path program 5 times [2022-11-23 13:47:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:47:55,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568699277] [2022-11-23 13:47:55,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:47:55,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:47:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:47:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:56,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:47:56,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568699277] [2022-11-23 13:47:56,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568699277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:47:56,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537009494] [2022-11-23 13:47:56,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:47:56,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:47:56,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:47:56,600 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:47:56,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 13:47:56,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 13:47:56,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:47:56,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-23 13:47:56,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:47:56,867 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:47:56,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:47:56,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:47:57,017 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:47:57,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 13:47:57,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:47:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:47:57,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:47:57,505 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_558 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_558) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2022-11-23 13:47:57,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_558 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_558) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-23 13:47:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-23 13:47:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537009494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:47:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [283721895] [2022-11-23 13:47:57,925 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:47:57,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:47:57,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-11-23 13:47:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207062285] [2022-11-23 13:47:57,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:47:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 13:47:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:47:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 13:47:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=580, Unknown=16, NotChecked=98, Total=756 [2022-11-23 13:47:57,930 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:47:59,905 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2022-11-23 13:47:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:47:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 13:47:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:47:59,906 INFO L225 Difference]: With dead ends: 35 [2022-11-23 13:47:59,907 INFO L226 Difference]: Without dead ends: 35 [2022-11-23 13:47:59,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=143, Invalid=970, Unknown=17, NotChecked=130, Total=1260 [2022-11-23 13:47:59,908 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 28 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:47:59,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 394 Invalid, 37 Unknown, 53 Unchecked, 0.8s Time] [2022-11-23 13:47:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-23 13:47:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-11-23 13:47:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.59375) internal successors, (51), 33 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2022-11-23 13:47:59,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 51 transitions. Word has length 17 [2022-11-23 13:47:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:47:59,912 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 51 transitions. [2022-11-23 13:47:59,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:47:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 51 transitions. [2022-11-23 13:47:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:47:59,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:47:59,913 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:47:59,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:00,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 13:48:00,120 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:00,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1872502330, now seen corresponding path program 3 times [2022-11-23 13:48:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:48:00,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767284220] [2022-11-23 13:48:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:48:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:01,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:48:01,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767284220] [2022-11-23 13:48:01,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767284220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:48:01,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425723735] [2022-11-23 13:48:01,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:48:01,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:48:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:48:01,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:48:01,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 13:48:01,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:48:01,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:48:01,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-23 13:48:01,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:01,737 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:48:01,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:48:01,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:01,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:01,913 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:48:01,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 13:48:01,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:02,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:48:02,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_624) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)) 0)) is different from false [2022-11-23 13:48:02,963 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_624) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 7 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2022-11-23 13:48:02,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (= (select (select (store |c_#memory_int| c_~v~0.base v_ArrVal_624) 3) 7) 0)) is different from false [2022-11-23 13:48:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-23 13:48:09,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425723735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:48:09,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [382327645] [2022-11-23 13:48:09,363 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:48:09,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:48:09,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-11-23 13:48:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913077797] [2022-11-23 13:48:09,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:48:09,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 13:48:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:48:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 13:48:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=936, Unknown=43, NotChecked=192, Total=1260 [2022-11-23 13:48:09,366 INFO L87 Difference]: Start difference. First operand 34 states and 51 transitions. Second operand has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:14,293 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-11-23 13:48:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:48:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 13:48:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:14,294 INFO L225 Difference]: With dead ends: 47 [2022-11-23 13:48:14,294 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 13:48:14,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=250, Invalid=1697, Unknown=45, NotChecked=264, Total=2256 [2022-11-23 13:48:14,296 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 95 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:14,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 505 Invalid, 10 Unknown, 72 Unchecked, 0.8s Time] [2022-11-23 13:48:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 13:48:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-11-23 13:48:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-11-23 13:48:14,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 17 [2022-11-23 13:48:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:14,299 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2022-11-23 13:48:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-11-23 13:48:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:48:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:14,301 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:14,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:14,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 13:48:14,507 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2081651952, now seen corresponding path program 6 times [2022-11-23 13:48:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:48:14,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979149110] [2022-11-23 13:48:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:48:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:15,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:48:15,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979149110] [2022-11-23 13:48:15,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979149110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:48:15,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894218894] [2022-11-23 13:48:15,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:48:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:48:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:48:15,937 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:48:15,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:48:16,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:48:16,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:48:16,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-23 13:48:16,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:16,236 INFO L321 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2022-11-23 13:48:16,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 53 [2022-11-23 13:48:16,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:16,355 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 13:48:16,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 13:48:16,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:16,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:16,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:16,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:16,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:16,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:16,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:16,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:16,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:17,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:17,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:17,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:17,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:48:17,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-23 13:48:17,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2022-11-23 13:48:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:18,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894218894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:48:18,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1202360391] [2022-11-23 13:48:18,273 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:48:18,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:48:18,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2022-11-23 13:48:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273425805] [2022-11-23 13:48:18,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:48:18,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 13:48:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:48:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 13:48:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=884, Unknown=11, NotChecked=0, Total=992 [2022-11-23 13:48:18,276 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:20,163 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-11-23 13:48:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:48:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 13:48:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:20,165 INFO L225 Difference]: With dead ends: 40 [2022-11-23 13:48:20,165 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 13:48:20,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=221, Invalid=1408, Unknown=11, NotChecked=0, Total=1640 [2022-11-23 13:48:20,166 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:20,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 13:48:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 13:48:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-23 13:48:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-11-23 13:48:20,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2022-11-23 13:48:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:20,169 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-11-23 13:48:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-11-23 13:48:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:48:20,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:20,170 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:20,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:20,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-23 13:48:20,382 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:20,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1680120036, now seen corresponding path program 1 times [2022-11-23 13:48:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:48:20,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839560273] [2022-11-23 13:48:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:48:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:21,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:48:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839560273] [2022-11-23 13:48:21,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839560273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:48:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788729329] [2022-11-23 13:48:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:21,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:48:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:48:21,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:48:21,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 13:48:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:21,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 13:48:21,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:22,013 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 13:48:22,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-23 13:48:22,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,110 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 13:48:22,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 13:48:22,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 13:48:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:22,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:48:22,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_756) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)) 0)) is different from false [2022-11-23 13:48:22,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_756) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2022-11-23 13:48:23,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_756) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2022-11-23 13:48:23,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_756) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 6 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2022-11-23 13:48:23,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_756) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 7 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2022-11-23 13:48:23,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int)) (v_ArrVal_749 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_749) c_~v~0.base v_ArrVal_756) 3) 7) 0)) is different from false [2022-11-23 13:48:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-11-23 13:48:23,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788729329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:48:23,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339796573] [2022-11-23 13:48:23,339 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 13:48:23,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:48:23,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2022-11-23 13:48:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899528582] [2022-11-23 13:48:23,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:48:23,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 13:48:23,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:48:23,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 13:48:23,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=835, Unknown=31, NotChecked=378, Total=1332 [2022-11-23 13:48:23,343 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 37 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:26,575 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-11-23 13:48:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:48:26,576 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 13:48:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:26,576 INFO L225 Difference]: With dead ends: 51 [2022-11-23 13:48:26,577 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 13:48:26,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=268, Invalid=1614, Unknown=34, NotChecked=534, Total=2450 [2022-11-23 13:48:26,578 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 77 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:26,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 421 Invalid, 17 Unknown, 172 Unchecked, 0.7s Time] [2022-11-23 13:48:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 13:48:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2022-11-23 13:48:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-11-23 13:48:26,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 18 [2022-11-23 13:48:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:26,580 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-11-23 13:48:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-11-23 13:48:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 13:48:26,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:26,584 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:26,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:26,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:48:26,790 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash -116130161, now seen corresponding path program 7 times [2022-11-23 13:48:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:48:26,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004615134] [2022-11-23 13:48:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:48:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:48:26,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:48:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:48:26,906 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:48:26,906 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:48:26,908 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2022-11-23 13:48:26,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2022-11-23 13:48:26,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2022-11-23 13:48:26,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2022-11-23 13:48:26,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2022-11-23 13:48:26,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2022-11-23 13:48:26,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2022-11-23 13:48:26,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2022-11-23 13:48:26,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2022-11-23 13:48:26,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2022-11-23 13:48:26,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2022-11-23 13:48:26,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2022-11-23 13:48:26,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2022-11-23 13:48:26,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2022-11-23 13:48:26,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2022-11-23 13:48:26,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2022-11-23 13:48:26,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2022-11-23 13:48:26,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2022-11-23 13:48:26,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2022-11-23 13:48:26,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2022-11-23 13:48:26,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2022-11-23 13:48:26,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2022-11-23 13:48:26,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2022-11-23 13:48:26,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2022-11-23 13:48:26,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2022-11-23 13:48:26,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2022-11-23 13:48:26,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 13:48:26,919 INFO L444 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:26,926 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:48:26,926 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:48:26,955 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,956 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,957 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,957 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,960 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,960 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,960 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,961 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,961 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,961 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,961 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,962 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,966 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,966 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,966 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,967 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,968 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,968 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,969 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,970 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,971 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,971 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,971 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,976 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,978 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,979 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,979 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,979 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,980 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,982 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,983 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,984 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,985 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,986 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,986 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,986 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,986 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,987 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:48:26,988 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,988 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:26,988 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:48:26,988 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:48:27,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:48:27 BasicIcfg [2022-11-23 13:48:27,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:48:27,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:48:27,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:48:27,026 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:48:27,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:19" (3/4) ... [2022-11-23 13:48:27,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 13:48:27,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:48:27,030 INFO L158 Benchmark]: Toolchain (without parser) took 69779.57ms. Allocated memory was 125.8MB in the beginning and 318.8MB in the end (delta: 192.9MB). Free memory was 62.8MB in the beginning and 145.9MB in the end (delta: -83.1MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2022-11-23 13:48:27,031 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:48:27,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1167.41ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 62.5MB in the beginning and 92.9MB in the end (delta: -30.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-11-23 13:48:27,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.48ms. Allocated memory is still 151.0MB. Free memory was 92.9MB in the beginning and 90.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:48:27,031 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 151.0MB. Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:48:27,034 INFO L158 Benchmark]: RCFGBuilder took 752.84ms. Allocated memory is still 151.0MB. Free memory was 88.7MB in the beginning and 71.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 13:48:27,036 INFO L158 Benchmark]: TraceAbstraction took 67694.11ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 71.8MB in the beginning and 145.9MB in the end (delta: -74.1MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2022-11-23 13:48:27,042 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 318.8MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:48:27,045 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.32ms. Allocated memory is still 125.8MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1167.41ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 62.5MB in the beginning and 92.9MB in the end (delta: -30.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.48ms. Allocated memory is still 151.0MB. Free memory was 92.9MB in the beginning and 90.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 151.0MB. Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 752.84ms. Allocated memory is still 151.0MB. Free memory was 88.7MB in the beginning and 71.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67694.11ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 71.8MB in the beginning and 145.9MB in the end (delta: -74.1MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 318.8MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 121 PlacesBefore, 39 PlacesAfterwards, 119 TransitionsBefore, 34 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 6 FixpointIterations, 72 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 134 TotalNumberOfCompositions, 485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 396, independent: 378, independent conditional: 0, independent unconditional: 378, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 240, independent: 228, independent conditional: 0, independent unconditional: 228, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 240, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 396, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 240, unknown conditional: 0, unknown unconditional: 240] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1107. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [#in~arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={10:0}, t2={9:0}, v={0:0}] [L1123] 0 \read(t1) VAL [#in~arg={0:0}, \read(t1)=-2, t1={10:0}, t2={9:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [#in~arg={0:0}, \read(t1)=-2, \result={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-3:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [#in~arg={0:0}, \result={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={10:0}, t2={9:0}, v={-3:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] 0 \read(t2) VAL [#in~arg={0:0}, \read(t2)=-1, \result={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-3:0}] [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [#in~arg={0:0}, \read(t2)=-1, \result={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-3:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 152 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 67.3s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 114 mSolverCounterUnknown, 1333 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1333 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 420 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3861 IncrementalHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 526 mSolverCounterUnsat, 5 mSDtfsCounter, 3861 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 179 SyntacticMatches, 7 SemanticMatches, 429 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 172 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 481 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 589 ConstructedInterpolants, 137 QuantifiedInterpolants, 11077 SizeOfPredicates, 97 NumberOfNonLiveVariables, 3133 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 50 InterpolantComputations, 13 PerfectInterpolantSequences, 58/470 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 13:48:27,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/bigshot_s.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW --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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:48:29,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:48:29,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:48:30,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:48:30,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:48:30,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:48:30,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:48:30,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:48:30,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:48:30,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:48:30,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:48:30,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:48:30,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:48:30,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:48:30,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:48:30,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:48:30,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:48:30,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:48:30,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:48:30,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:48:30,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:48:30,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:48:30,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:48:30,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:48:30,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:48:30,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:48:30,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:48:30,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:48:30,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:48:30,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:48:30,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:48:30,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:48:30,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:48:30,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:48:30,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:48:30,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:48:30,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:48:30,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:48:30,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:48:30,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:48:30,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:48:30,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 13:48:30,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:48:30,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:48:30,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:48:30,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:48:30,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:48:30,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:48:30,162 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:48:30,162 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:48:30,162 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:48:30,162 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:48:30,164 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:48:30,164 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:48:30,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:48:30,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:48:30,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:48:30,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:48:30,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:48:30,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:48:30,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:48:30,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:48:30,167 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:48:30,167 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:48:30,167 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 13:48:30,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:48:30,168 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:48:30,168 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 13:48:30,168 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 13:48:30,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:48:30,169 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:48:30,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:48:30,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 13:48:30,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:48:30,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:48:30,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:48:30,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:48:30,171 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 13:48:30,171 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 13:48:30,171 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:48:30,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 13:48:30,172 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2022-11-23 13:48:30,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:48:30,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:48:30,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:48:30,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:48:30,735 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:48:30,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread/bigshot_s.i [2022-11-23 13:48:34,251 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:48:34,723 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:48:34,724 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/sv-benchmarks/c/pthread/bigshot_s.i [2022-11-23 13:48:34,747 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data/59e0469a6/4be7257c91ce450b83817a4645849f4d/FLAGcd9178215 [2022-11-23 13:48:34,776 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/data/59e0469a6/4be7257c91ce450b83817a4645849f4d [2022-11-23 13:48:34,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:48:34,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:48:34,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:48:34,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:48:34,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:48:34,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:48:34" (1/1) ... [2022-11-23 13:48:34,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1682fdf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:34, skipping insertion in model container [2022-11-23 13:48:34,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:48:34" (1/1) ... [2022-11-23 13:48:34,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:48:34,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:48:35,555 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-23 13:48:35,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:48:35,591 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:48:35,632 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-23 13:48:35,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:48:35,741 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:48:35,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35 WrapperNode [2022-11-23 13:48:35,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:48:35,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:48:35,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:48:35,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:48:35,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,807 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-11-23 13:48:35,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:48:35,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:48:35,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:48:35,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:48:35,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,844 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:48:35,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:48:35,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:48:35,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:48:35,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (1/1) ... [2022-11-23 13:48:35,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:48:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:48:35,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:48:35,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:48:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 13:48:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 13:48:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:48:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:48:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 13:48:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 13:48:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 13:48:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 13:48:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 13:48:35,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 13:48:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-23 13:48:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 13:48:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:48:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:48:35,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:48:35,960 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:48:36,149 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:48:36,152 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:48:36,668 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:48:36,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:48:36,677 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 13:48:36,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:48:36 BoogieIcfgContainer [2022-11-23 13:48:36,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:48:36,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:48:36,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:48:36,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:48:36,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:48:34" (1/3) ... [2022-11-23 13:48:36,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb9027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:48:36, skipping insertion in model container [2022-11-23 13:48:36,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:35" (2/3) ... [2022-11-23 13:48:36,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb9027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:48:36, skipping insertion in model container [2022-11-23 13:48:36,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:48:36" (3/3) ... [2022-11-23 13:48:36,704 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2022-11-23 13:48:36,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:48:36,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 13:48:36,733 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:48:36,896 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 13:48:36,950 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:48:36,976 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 120 transitions, 256 flow [2022-11-23 13:48:36,986 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 120 transitions, 256 flow [2022-11-23 13:48:36,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 120 transitions, 256 flow [2022-11-23 13:48:37,091 INFO L130 PetriNetUnfolder]: 5/118 cut-off events. [2022-11-23 13:48:37,092 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 13:48:37,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 5/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-23 13:48:37,100 INFO L119 LiptonReduction]: Number of co-enabled transitions 360 [2022-11-23 13:48:54,481 INFO L134 LiptonReduction]: Checked pairs total: 464 [2022-11-23 13:48:54,482 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-11-23 13:48:54,495 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 34 transitions, 84 flow [2022-11-23 13:48:54,509 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:54,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:48:54,539 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@733a48fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:48:54,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-23 13:48:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 13:48:54,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:54,549 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 13:48:54,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash 465, now seen corresponding path program 1 times [2022-11-23 13:48:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:54,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637679200] [2022-11-23 13:48:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:54,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:54,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:54,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 13:48:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:54,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 13:48:54,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:54,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:54,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637679200] [2022-11-23 13:48:54,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637679200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:54,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 13:48:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407457652] [2022-11-23 13:48:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:54,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:48:54,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:54,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:48:54,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:48:54,773 INFO L87 Difference]: Start difference. First operand has 57 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:54,969 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2022-11-23 13:48:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:48:54,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-23 13:48:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:54,980 INFO L225 Difference]: With dead ends: 47 [2022-11-23 13:48:54,982 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 13:48:54,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:48:54,988 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:54,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:48:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 13:48:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-23 13:48:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 3.0) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 75 transitions. [2022-11-23 13:48:55,042 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 75 transitions. Word has length 1 [2022-11-23 13:48:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:55,043 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 75 transitions. [2022-11-23 13:48:55,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 75 transitions. [2022-11-23 13:48:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 13:48:55,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:55,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 13:48:55,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-23 13:48:55,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:55,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash 457424, now seen corresponding path program 1 times [2022-11-23 13:48:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:55,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020898662] [2022-11-23 13:48:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:55,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:55,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:55,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:55,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 13:48:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:55,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:48:55,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:55,467 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 13:48:55,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-23 13:48:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:55,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:55,510 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:55,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020898662] [2022-11-23 13:48:55,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020898662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:55,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:55,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:48:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597118904] [2022-11-23 13:48:55,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:55,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:48:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:48:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:48:55,515 INFO L87 Difference]: Start difference. First operand 47 states and 75 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:55,629 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2022-11-23 13:48:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:48:55,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 13:48:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:55,631 INFO L225 Difference]: With dead ends: 45 [2022-11-23 13:48:55,631 INFO L226 Difference]: Without dead ends: 45 [2022-11-23 13:48:55,632 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:48:55,633 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:55,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:48:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-23 13:48:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-23 13:48:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 3.0) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-11-23 13:48:55,641 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 3 [2022-11-23 13:48:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:55,642 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-11-23 13:48:55,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-11-23 13:48:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 13:48:55,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:55,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 13:48:55,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:55,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:55,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash 457425, now seen corresponding path program 1 times [2022-11-23 13:48:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:55,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613960768] [2022-11-23 13:48:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:55,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:55,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:55,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 13:48:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:55,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:48:55,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:56,003 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 13:48:56,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-23 13:48:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:56,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:56,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613960768] [2022-11-23 13:48:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613960768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:56,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:56,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:48:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896049666] [2022-11-23 13:48:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:56,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:48:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:48:56,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:48:56,090 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:56,248 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2022-11-23 13:48:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:48:56,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 13:48:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:56,250 INFO L225 Difference]: With dead ends: 44 [2022-11-23 13:48:56,250 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 13:48:56,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:48:56,251 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:56,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:48:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 13:48:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-23 13:48:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 43 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-11-23 13:48:56,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 3 [2022-11-23 13:48:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:56,259 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-11-23 13:48:56,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-11-23 13:48:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 13:48:56,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:56,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 13:48:56,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:56,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:56,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash 14181590, now seen corresponding path program 1 times [2022-11-23 13:48:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:56,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733274691] [2022-11-23 13:48:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:56,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:56,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 13:48:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:56,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:48:56,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:56,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:56,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-23 13:48:56,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 13:48:56,726 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:48:56,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 13:48:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:56,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:56,799 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:56,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733274691] [2022-11-23 13:48:56,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733274691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:56,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:56,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:48:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223272969] [2022-11-23 13:48:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:56,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:48:56,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:48:56,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:48:56,802 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:57,054 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-11-23 13:48:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:48:57,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-23 13:48:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:57,057 INFO L225 Difference]: With dead ends: 43 [2022-11-23 13:48:57,058 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 13:48:57,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:48:57,059 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:57,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:48:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 13:48:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-23 13:48:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 3.0) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-11-23 13:48:57,078 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 4 [2022-11-23 13:48:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:57,078 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2022-11-23 13:48:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-11-23 13:48:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 13:48:57,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:57,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 13:48:57,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:57,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:57,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash 742604810, now seen corresponding path program 1 times [2022-11-23 13:48:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:57,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031891212] [2022-11-23 13:48:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:57,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:57,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:57,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 13:48:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:57,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:48:57,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:57,429 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:48:57,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-23 13:48:57,462 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 13:48:57,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-23 13:48:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:48:57,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:48:57,545 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:48:57,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:48:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:57,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:57,570 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:57,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031891212] [2022-11-23 13:48:57,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031891212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:57,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:57,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:48:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191189571] [2022-11-23 13:48:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:57,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:48:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:48:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:48:57,573 INFO L87 Difference]: Start difference. First operand 43 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:57,674 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-11-23 13:48:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:48:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 13:48:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:57,675 INFO L225 Difference]: With dead ends: 27 [2022-11-23 13:48:57,676 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 13:48:57,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:48:57,677 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:57,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:48:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 13:48:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 13:48:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-11-23 13:48:57,682 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 6 [2022-11-23 13:48:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:57,683 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-11-23 13:48:57,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-11-23 13:48:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:48:57,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:57,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:57,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:57,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:57,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -436376638, now seen corresponding path program 1 times [2022-11-23 13:48:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:57,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740759417] [2022-11-23 13:48:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:57,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:57,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:57,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 13:48:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:58,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:48:58,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:58,083 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-23 13:48:58,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2022-11-23 13:48:58,145 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 13:48:58,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-23 13:48:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:58,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:58,301 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:58,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740759417] [2022-11-23 13:48:58,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740759417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:58,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:58,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:48:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659343290] [2022-11-23 13:48:58,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:58,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:48:58,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:58,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:48:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:48:58,303 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:58,440 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-11-23 13:48:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:48:58,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:48:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:58,442 INFO L225 Difference]: With dead ends: 31 [2022-11-23 13:48:58,442 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 13:48:58,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:48:58,443 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:58,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:48:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 13:48:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-23 13:48:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-23 13:48:58,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2022-11-23 13:48:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:58,449 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-23 13:48:58,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-23 13:48:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:48:58,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:58,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:58,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:58,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:58,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:58,662 INFO L85 PathProgramCache]: Analyzing trace with hash -436376521, now seen corresponding path program 1 times [2022-11-23 13:48:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:58,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195451825] [2022-11-23 13:48:58,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:58,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:58,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:58,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:58,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 13:48:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:58,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 13:48:58,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:58,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:48:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:58,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:58,851 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195451825] [2022-11-23 13:48:58,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195451825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:58,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:58,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:48:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703140696] [2022-11-23 13:48:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:58,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:48:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:58,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:48:58,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:48:58,854 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:59,025 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2022-11-23 13:48:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:48:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:48:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:59,027 INFO L225 Difference]: With dead ends: 36 [2022-11-23 13:48:59,027 INFO L226 Difference]: Without dead ends: 36 [2022-11-23 13:48:59,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:48:59,028 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:59,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:48:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-23 13:48:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2022-11-23 13:48:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 2.1) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2022-11-23 13:48:59,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 9 [2022-11-23 13:48:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:59,052 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. [2022-11-23 13:48:59,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. [2022-11-23 13:48:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:48:59,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:59,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:59,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:59,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:59,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -436376552, now seen corresponding path program 1 times [2022-11-23 13:48:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367647762] [2022-11-23 13:48:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:59,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:59,266 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:59,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 13:48:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:59,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 13:48:59,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:59,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 13:48:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:48:59,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:48:59,395 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:48:59,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367647762] [2022-11-23 13:48:59,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367647762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:48:59,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:48:59,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:48:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543525172] [2022-11-23 13:48:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:48:59,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:48:59,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:48:59,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:48:59,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:48:59,397 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:48:59,528 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2022-11-23 13:48:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:48:59,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:48:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:48:59,529 INFO L225 Difference]: With dead ends: 27 [2022-11-23 13:48:59,529 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 13:48:59,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:48:59,530 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:48:59,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:48:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 13:48:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-23 13:48:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.894736842105263) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2022-11-23 13:48:59,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 9 [2022-11-23 13:48:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:48:59,542 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. [2022-11-23 13:48:59,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:48:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2022-11-23 13:48:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:48:59,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:48:59,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:48:59,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 13:48:59,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:59,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:48:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:48:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -436376579, now seen corresponding path program 1 times [2022-11-23 13:48:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:48:59,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001344226] [2022-11-23 13:48:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:48:59,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:48:59,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:48:59,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:48:59,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 13:48:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:48:59,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 13:48:59,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:48:59,999 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-23 13:49:00,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-23 13:49:00,054 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 13:49:00,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-23 13:49:00,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:00,302 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 13:49:00,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-11-23 13:49:00,370 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2022-11-23 13:49:00,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2022-11-23 13:49:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:00,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:49:00,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:00,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001344226] [2022-11-23 13:49:00,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001344226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:49:00,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:49:00,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:49:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755959365] [2022-11-23 13:49:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:49:00,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:49:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:49:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:49:00,677 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:01,111 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-11-23 13:49:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:49:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 13:49:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:01,112 INFO L225 Difference]: With dead ends: 28 [2022-11-23 13:49:01,112 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 13:49:01,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:49:01,114 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:01,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:49:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 13:49:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-11-23 13:49:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2022-11-23 13:49:01,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 9 [2022-11-23 13:49:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:01,118 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-11-23 13:49:01,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-11-23 13:49:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:49:01,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:01,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:01,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:01,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:01,331 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -642768909, now seen corresponding path program 1 times [2022-11-23 13:49:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:01,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67146341] [2022-11-23 13:49:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:01,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:01,333 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:01,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 13:49:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:01,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:49:01,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:01,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:49:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:01,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:01,674 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:01,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67146341] [2022-11-23 13:49:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67146341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [39031517] [2022-11-23 13:49:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:01,675 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:01,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:49:01,678 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:49:01,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-23 13:49:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:01,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:49:01,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:01,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:49:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:01,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:01,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [39031517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:01,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482777696] [2022-11-23 13:49:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:01,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:01,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:02,001 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:02,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:49:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:02,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:49:02,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:02,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:49:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:02,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:02,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482777696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:02,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:49:02,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 7 [2022-11-23 13:49:02,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997652734] [2022-11-23 13:49:02,212 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:02,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:49:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:02,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:49:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:49:02,214 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:02,697 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-11-23 13:49:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:49:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 13:49:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:02,699 INFO L225 Difference]: With dead ends: 55 [2022-11-23 13:49:02,699 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 13:49:02,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-23 13:49:02,701 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:02,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:49:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 13:49:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. [2022-11-23 13:49:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 2.2) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2022-11-23 13:49:02,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 10 [2022-11-23 13:49:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:02,705 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2022-11-23 13:49:02,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2022-11-23 13:49:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 13:49:02,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:02,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:02,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:02,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:03,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:03,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:03,318 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -642768967, now seen corresponding path program 1 times [2022-11-23 13:49:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062982687] [2022-11-23 13:49:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:03,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:03,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:03,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 13:49:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:03,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 13:49:03,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:03,542 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 13:49:03,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-23 13:49:03,606 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-23 13:49:03,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-23 13:49:03,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:03,814 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 13:49:03,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-11-23 13:49:03,878 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2022-11-23 13:49:03,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2022-11-23 13:49:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:04,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:04,488 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:04,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062982687] [2022-11-23 13:49:04,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062982687] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:04,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1548386248] [2022-11-23 13:49:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:04,489 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:04,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:49:04,491 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:49:04,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-23 13:49:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:04,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 13:49:04,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:04,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:04,823 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 13:49:04,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-23 13:49:04,851 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:49:04,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:49:04,953 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:49:04,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-23 13:49:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:05,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:07,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1548386248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:07,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959758325] [2022-11-23 13:49:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:07,603 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:07,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 13:49:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:07,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 13:49:07,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:07,850 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-23 13:49:07,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-23 13:49:07,913 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 13:49:07,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-23 13:49:08,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:08,049 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-23 13:49:08,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-11-23 13:49:08,112 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2022-11-23 13:49:08,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2022-11-23 13:49:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:08,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:08,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959758325] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:08,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:49:08,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5, 5, 4, 4] total 18 [2022-11-23 13:49:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436857002] [2022-11-23 13:49:08,673 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:08,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:49:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:08,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:49:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=271, Unknown=1, NotChecked=0, Total=380 [2022-11-23 13:49:08,675 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:11,146 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-11-23 13:49:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:49:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 13:49:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:11,148 INFO L225 Difference]: With dead ends: 49 [2022-11-23 13:49:11,148 INFO L226 Difference]: Without dead ends: 49 [2022-11-23 13:49:11,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=298, Invalid=631, Unknown=1, NotChecked=0, Total=930 [2022-11-23 13:49:11,150 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:11,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 13:49:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-23 13:49:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2022-11-23 13:49:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.96) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2022-11-23 13:49:11,154 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 10 [2022-11-23 13:49:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:11,154 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2022-11-23 13:49:11,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2022-11-23 13:49:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 13:49:11,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:11,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:11,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-23 13:49:11,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:11,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:11,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:11,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1548403989, now seen corresponding path program 1 times [2022-11-23 13:49:11,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:11,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94835088] [2022-11-23 13:49:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:11,766 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:11,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-23 13:49:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:11,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 13:49:11,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:11,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:49:11,910 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:11,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94835088] [2022-11-23 13:49:11,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94835088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:49:11,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:49:11,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:49:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398655220] [2022-11-23 13:49:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:49:11,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:49:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:49:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:49:11,912 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:11,983 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2022-11-23 13:49:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:49:11,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 13:49:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:11,985 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:49:11,986 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 13:49:11,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:49:11,987 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:11,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:49:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 13:49:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 13:49:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.88) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2022-11-23 13:49:11,992 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 11 [2022-11-23 13:49:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:11,992 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2022-11-23 13:49:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2022-11-23 13:49:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:49:11,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:11,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:12,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:12,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash 756281292, now seen corresponding path program 1 times [2022-11-23 13:49:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:12,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31700546] [2022-11-23 13:49:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:12,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:12,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:12,210 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:12,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 13:49:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:12,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 13:49:12,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:12,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-23 13:49:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:12,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:49:12,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31700546] [2022-11-23 13:49:12,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31700546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:49:12,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:49:12,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:49:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113059797] [2022-11-23 13:49:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:49:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:49:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:49:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:49:12,466 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:12,614 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2022-11-23 13:49:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:49:12,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:49:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:12,616 INFO L225 Difference]: With dead ends: 33 [2022-11-23 13:49:12,616 INFO L226 Difference]: Without dead ends: 33 [2022-11-23 13:49:12,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:49:12,617 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:12,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:49:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-23 13:49:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-23 13:49:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. [2022-11-23 13:49:12,620 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 50 transitions. Word has length 12 [2022-11-23 13:49:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:12,621 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 50 transitions. [2022-11-23 13:49:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2022-11-23 13:49:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:49:12,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:12,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:12,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:12,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:12,822 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 756281280, now seen corresponding path program 1 times [2022-11-23 13:49:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:12,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126600748] [2022-11-23 13:49:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:12,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:12,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:12,825 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:12,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-23 13:49:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:13,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 13:49:13,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:13,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:13,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:13,058 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-23 13:49:13,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 13:49:13,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:13,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:49:13,158 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126600748] [2022-11-23 13:49:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126600748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:49:13,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:49:13,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:49:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127426643] [2022-11-23 13:49:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:49:13,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:49:13,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:13,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:49:13,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:49:13,165 INFO L87 Difference]: Start difference. First operand 32 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:13,303 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. [2022-11-23 13:49:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:49:13,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:49:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:13,304 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:49:13,304 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 13:49:13,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:49:13,305 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:13,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:49:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 13:49:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 13:49:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.8) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2022-11-23 13:49:13,309 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 12 [2022-11-23 13:49:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:13,309 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2022-11-23 13:49:13,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2022-11-23 13:49:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:49:13,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:13,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:13,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:13,515 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1969536686, now seen corresponding path program 1 times [2022-11-23 13:49:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:13,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059092959] [2022-11-23 13:49:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:13,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:13,518 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:13,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-23 13:49:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:13,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:49:13,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:13,769 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:49:13,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:49:13,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:13,905 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:49:13,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:49:13,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:14,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:14,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:14,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_264 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_264) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-23 13:49:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 13:49:14,434 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:14,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059092959] [2022-11-23 13:49:14,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059092959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:14,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [218278357] [2022-11-23 13:49:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:14,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:49:14,436 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:49:14,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-23 13:49:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:14,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 13:49:14,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:14,796 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:49:14,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:49:14,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:14,919 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:49:14,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:49:15,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:15,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:15,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:15,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_287) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-23 13:49:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 13:49:15,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [218278357] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:15,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468151882] [2022-11-23 13:49:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:15,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:15,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:15,800 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:15,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 13:49:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:15,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:49:15,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:15,980 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:49:15,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:49:15,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:16,095 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:49:16,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:49:16,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:16,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:16,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:16,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468151882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:16,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:49:16,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 19 [2022-11-23 13:49:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609166977] [2022-11-23 13:49:16,599 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:16,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:49:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:49:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=230, Unknown=25, NotChecked=66, Total=380 [2022-11-23 13:49:16,601 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:21,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:49:23,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:49:25,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:49:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:25,614 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2022-11-23 13:49:25,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:49:25,615 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:49:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:25,616 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:49:25,616 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 13:49:25,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=99, Invalid=302, Unknown=27, NotChecked=78, Total=506 [2022-11-23 13:49:25,617 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 16 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:25,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 99 Invalid, 16 Unknown, 36 Unchecked, 8.1s Time] [2022-11-23 13:49:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 13:49:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 13:49:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.72) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-11-23 13:49:25,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 13 [2022-11-23 13:49:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:25,621 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-23 13:49:25,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2022-11-23 13:49:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:49:25,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:25,623 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:25,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-23 13:49:25,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:26,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-11-23 13:49:26,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:26,227 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1763017929, now seen corresponding path program 2 times [2022-11-23 13:49:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:26,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922042750] [2022-11-23 13:49:26,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:26,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:26,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:26,230 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:26,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-23 13:49:26,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 13:49:26,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:26,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:49:26,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:26,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:26,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:26,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:26,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 13:49:26,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 13:49:26,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:49:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 13:49:26,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:49:26,572 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:26,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922042750] [2022-11-23 13:49:26,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922042750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:49:26,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:49:26,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:49:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146789753] [2022-11-23 13:49:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:49:26,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:49:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:49:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:49:26,575 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:26,709 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2022-11-23 13:49:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:49:26,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:49:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:26,711 INFO L225 Difference]: With dead ends: 27 [2022-11-23 13:49:26,711 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 13:49:26,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:49:26,712 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:26,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:49:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 13:49:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 13:49:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2022-11-23 13:49:26,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 13 [2022-11-23 13:49:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:26,715 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2022-11-23 13:49:26,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2022-11-23 13:49:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:49:26,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:26,716 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:26,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:26,917 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1763017987, now seen corresponding path program 2 times [2022-11-23 13:49:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:26,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778507622] [2022-11-23 13:49:26,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:26,919 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:26,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-23 13:49:27,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 13:49:27,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:27,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:49:27,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:27,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:27,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:27,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:27,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 13:49:27,162 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:49:27,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:49:27,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:27,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:49:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:27,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:27,833 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:27,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778507622] [2022-11-23 13:49:27,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778507622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:27,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1416015564] [2022-11-23 13:49:27,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:27,834 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:27,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:49:27,839 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:49:27,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-23 13:49:28,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 13:49:28,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:28,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:49:28,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:28,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,219 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:49:28,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-23 13:49:28,310 INFO L321 Elim1Store]: treesize reduction 63, result has 33.7 percent of original size [2022-11-23 13:49:28,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 63 [2022-11-23 13:49:28,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:49:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:28,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:28,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1416015564] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:28,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708308987] [2022-11-23 13:49:28,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:28,736 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:28,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-23 13:49:28,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 13:49:28,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:28,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 13:49:28,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:28,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:28,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 13:49:28,967 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 13:49:28,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:49:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:29,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:32,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708308987] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:32,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:49:32,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 27 [2022-11-23 13:49:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715869359] [2022-11-23 13:49:32,493 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:32,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 13:49:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:32,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 13:49:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=610, Unknown=1, NotChecked=0, Total=812 [2022-11-23 13:49:32,495 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:36,798 INFO L93 Difference]: Finished difference Result 74 states and 100 transitions. [2022-11-23 13:49:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:49:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:49:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:36,799 INFO L225 Difference]: With dead ends: 74 [2022-11-23 13:49:36,799 INFO L226 Difference]: Without dead ends: 74 [2022-11-23 13:49:36,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=636, Invalid=1813, Unknown=1, NotChecked=0, Total=2450 [2022-11-23 13:49:36,801 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:36,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 13:49:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-23 13:49:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2022-11-23 13:49:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 2.0) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 72 transitions. [2022-11-23 13:49:36,805 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 72 transitions. Word has length 13 [2022-11-23 13:49:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:36,806 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 72 transitions. [2022-11-23 13:49:36,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2022-11-23 13:49:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:49:36,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:36,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:36,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-11-23 13:49:37,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-11-23 13:49:37,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-23 13:49:37,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:37,419 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 925748236, now seen corresponding path program 2 times [2022-11-23 13:49:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:37,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516127253] [2022-11-23 13:49:37,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:37,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:37,422 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:37,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-23 13:49:37,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 13:49:37,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:37,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 13:49:37,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:37,751 INFO L321 Elim1Store]: treesize reduction 118, result has 24.4 percent of original size [2022-11-23 13:49:37,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 65 [2022-11-23 13:49:37,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:37,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:49:38,023 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:49:38,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2022-11-23 13:49:38,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:49:38,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:39,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:39,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:39,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:40,480 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:49:40,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516127253] [2022-11-23 13:49:40,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516127253] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:40,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665425452] [2022-11-23 13:49:40,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:40,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:49:40,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:49:40,482 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:49:40,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-23 13:49:40,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 13:49:40,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:40,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 13:49:40,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:40,924 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:49:40,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:49:40,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:41,082 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:49:41,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:49:41,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:42,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:42,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:42,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:44,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1665425452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:44,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458084156] [2022-11-23 13:49:44,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:49:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:44,940 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:44,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-23 13:49:45,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 13:49:45,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:45,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 13:49:45,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:45,233 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:49:45,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:49:45,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:45,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:49:45,497 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:49:45,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:49:45,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:46,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:46,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:49:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:46,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:53,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458084156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:53,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:49:53,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 32 [2022-11-23 13:49:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796115496] [2022-11-23 13:49:53,024 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:53,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 13:49:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:49:53,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 13:49:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=886, Unknown=36, NotChecked=0, Total=1056 [2022-11-23 13:49:53,026 INFO L87 Difference]: Start difference. First operand 39 states and 72 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:57,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:49:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:58,878 INFO L93 Difference]: Finished difference Result 39 states and 70 transitions. [2022-11-23 13:49:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:49:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:49:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:58,879 INFO L225 Difference]: With dead ends: 39 [2022-11-23 13:49:58,879 INFO L226 Difference]: Without dead ends: 39 [2022-11-23 13:49:58,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=256, Invalid=1189, Unknown=37, NotChecked=0, Total=1482 [2022-11-23 13:49:58,881 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:58,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-23 13:49:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-23 13:49:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-23 13:49:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2022-11-23 13:49:58,885 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 14 [2022-11-23 13:49:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:58,885 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2022-11-23 13:49:58,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:49:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2022-11-23 13:49:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 13:49:58,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:58,886 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:58,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:59,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-23 13:49:59,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-11-23 13:49:59,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:59,490 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:49:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1366922642, now seen corresponding path program 3 times [2022-11-23 13:49:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:49:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600741222] [2022-11-23 13:49:59,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:49:59,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:49:59,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:49:59,493 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:49:59,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-23 13:49:59,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:49:59,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:49:59,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 13:49:59,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:59,848 INFO L321 Elim1Store]: treesize reduction 118, result has 24.4 percent of original size [2022-11-23 13:49:59,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 65 [2022-11-23 13:49:59,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:00,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:50:00,169 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:50:00,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2022-11-23 13:50:00,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:50:00,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:01,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:01,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:01,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:01,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:05,021 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:50:05,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600741222] [2022-11-23 13:50:05,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600741222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:05,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1507632459] [2022-11-23 13:50:05,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:50:05,022 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:50:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:50:05,023 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:50:05,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-11-23 13:50:05,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:50:05,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:05,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 13:50:05,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:05,564 INFO L321 Elim1Store]: treesize reduction 63, result has 33.7 percent of original size [2022-11-23 13:50:05,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 63 [2022-11-23 13:50:05,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:05,751 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:50:05,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:50:05,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:07,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:07,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:07,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:07,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:08,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_547) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-23 13:50:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-23 13:50:08,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1507632459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:08,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363159401] [2022-11-23 13:50:08,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:50:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:08,810 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:50:08,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-23 13:50:09,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 13:50:09,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:09,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 13:50:09,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:09,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:50:09,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:09,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:50:09,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:50:09,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:10,181 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:50:10,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-23 13:50:10,540 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:50:10,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-23 13:50:10,978 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:50:10,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-23 13:50:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:11,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:12,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 (_ BitVec 1)) (v_ArrVal_575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_578 (Array (_ BitVec 32) (_ BitVec 32))) (v_~v~0.base_103 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| v_~v~0.base_103 v_ArrVal_574) |c_ULTIMATE.start_main_~#t1~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_~#t2~0#1.base| (_ bv0 1))) (not (= (select |c_#valid| v_~v~0.base_103) (_ bv0 1))) (not (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) v_~v~0.base_103 v_ArrVal_578) (_ bv3 32)) (_ bv3 32))) (_ bv0 8))))) is different from false [2022-11-23 13:50:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:12,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363159401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:12,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:50:12,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 7, 8] total 42 [2022-11-23 13:50:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820884784] [2022-11-23 13:50:12,888 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:50:12,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 13:50:12,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:50:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 13:50:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1426, Unknown=30, NotChecked=158, Total=1806 [2022-11-23 13:50:12,890 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 43 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:17,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:50:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:29,988 INFO L93 Difference]: Finished difference Result 39 states and 68 transitions. [2022-11-23 13:50:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:50:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 13:50:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:29,991 INFO L225 Difference]: With dead ends: 39 [2022-11-23 13:50:29,991 INFO L226 Difference]: Without dead ends: 39 [2022-11-23 13:50:29,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=360, Invalid=2066, Unknown=32, NotChecked=194, Total=2652 [2022-11-23 13:50:29,993 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 47 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:29,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 312 Invalid, 9 Unknown, 40 Unchecked, 7.8s Time] [2022-11-23 13:50:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-23 13:50:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-23 13:50:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2022-11-23 13:50:29,996 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 15 [2022-11-23 13:50:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:29,997 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2022-11-23 13:50:29,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-11-23 13:50:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:50:29,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:29,998 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:30,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-23 13:50:30,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-11-23 13:50:30,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-11-23 13:50:30,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:30,607 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:50:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 574724172, now seen corresponding path program 4 times [2022-11-23 13:50:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:50:30,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621476614] [2022-11-23 13:50:30,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:50:30,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:50:30,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:50:30,610 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:50:30,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-23 13:50:30,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:50:30,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:30,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 13:50:30,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:30,901 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:50:30,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:50:30,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:31,021 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:50:31,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:50:31,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:31,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:31,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:31,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:31,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:31,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:31,581 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_612) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-23 13:50:31,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_612) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv4 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-23 13:50:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-23 13:50:31,982 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:50:31,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621476614] [2022-11-23 13:50:31,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621476614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:31,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [456500358] [2022-11-23 13:50:31,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:50:31,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:50:31,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:50:31,984 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:50:31,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-23 13:50:32,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:50:32,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:32,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 13:50:32,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:32,568 INFO L321 Elim1Store]: treesize reduction 63, result has 33.7 percent of original size [2022-11-23 13:50:32,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 63 [2022-11-23 13:50:32,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:32,712 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:50:32,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:50:32,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:33,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:33,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:34,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:34,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:34,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-23 13:50:34,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [456500358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531620330] [2022-11-23 13:50:34,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:50:34,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:50:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:34,850 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:50:34,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-23 13:50:35,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:50:35,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:35,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 13:50:35,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:35,087 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:50:35,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:50:35,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:35,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:50:35,215 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:50:35,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:50:35,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:35,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:36,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:36,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:36,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:50:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:36,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:50:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:48,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531620330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:50:48,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:50:48,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 41 [2022-11-23 13:50:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952593441] [2022-11-23 13:50:48,284 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:50:48,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 13:50:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:50:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 13:50:48,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1372, Unknown=37, NotChecked=154, Total=1722 [2022-11-23 13:50:48,286 INFO L87 Difference]: Start difference. First operand 39 states and 68 transitions. Second operand has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:02,555 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 95 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:51:08,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:51:11,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:51:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:13,074 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2022-11-23 13:51:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 13:51:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 13:51:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:13,076 INFO L225 Difference]: With dead ends: 60 [2022-11-23 13:51:13,076 INFO L226 Difference]: Without dead ends: 60 [2022-11-23 13:51:13,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=422, Invalid=2591, Unknown=75, NotChecked=218, Total=3306 [2022-11-23 13:51:13,078 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 58 mSolverCounterUnsat, 99 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 99 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:13,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 574 Invalid, 99 Unknown, 82 Unchecked, 11.5s Time] [2022-11-23 13:51:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-23 13:51:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-11-23 13:51:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2022-11-23 13:51:13,082 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 16 [2022-11-23 13:51:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:13,082 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2022-11-23 13:51:13,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2022-11-23 13:51:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:51:13,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:13,084 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:13,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-23 13:51:13,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-23 13:51:13,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-11-23 13:51:13,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:51:13,685 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:51:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 636233262, now seen corresponding path program 5 times [2022-11-23 13:51:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:51:13,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954219524] [2022-11-23 13:51:13,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 13:51:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:51:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:51:13,687 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:51:13,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-23 13:51:14,036 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-23 13:51:14,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:51:14,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 13:51:14,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:51:14,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:51:14,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:51:14,137 INFO L321 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2022-11-23 13:51:14,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 47 [2022-11-23 13:51:14,186 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:51:14,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-23 13:51:14,439 INFO L321 Elim1Store]: treesize reduction 6, result has 71.4 percent of original size [2022-11-23 13:51:14,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2022-11-23 13:51:14,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:51:14,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:14,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:15,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:15,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:15,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:15,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:15,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:51:15,585 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_712) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|)))))) is different from false [2022-11-23 13:51:15,712 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_712) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|)))))) is different from false [2022-11-23 13:51:15,727 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_712) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv4 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-23 13:51:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-23 13:51:16,325 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:51:16,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954219524] [2022-11-23 13:51:16,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954219524] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:51:16,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954056656] [2022-11-23 13:51:16,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 13:51:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:51:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:51:16,327 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:51:16,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-11-23 13:51:16,984 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-23 13:51:16,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:51:16,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 13:51:16,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:51:17,090 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:51:17,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:51:17,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:17,270 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:51:17,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:51:17,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:18,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:18,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:19,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:19,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:20,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:20,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:51:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-23 13:51:21,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1954056656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:51:21,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997580135] [2022-11-23 13:51:21,000 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 13:51:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:51:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:51:21,003 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:51:21,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-23 13:51:21,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-23 13:51:21,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:51:21,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 13:51:21,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:51:21,432 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:51:21,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:51:21,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:21,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:51:21,621 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:51:21,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:51:21,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:22,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:22,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:22,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:23,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:23,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:51:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:23,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:51:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:36,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997580135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:51:36,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:51:36,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 48 [2022-11-23 13:51:36,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661937393] [2022-11-23 13:51:36,194 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:51:36,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-23 13:51:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:51:36,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-23 13:51:36,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1861, Unknown=42, NotChecked=270, Total=2352 [2022-11-23 13:51:36,196 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand has 49 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 48 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:41,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:51:59,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:52:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:03,544 INFO L93 Difference]: Finished difference Result 58 states and 86 transitions. [2022-11-23 13:52:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:52:03,545 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 48 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 13:52:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:03,546 INFO L225 Difference]: With dead ends: 58 [2022-11-23 13:52:03,546 INFO L226 Difference]: Without dead ends: 58 [2022-11-23 13:52:03,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=387, Invalid=3185, Unknown=100, NotChecked=360, Total=4032 [2022-11-23 13:52:03,549 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 65 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:03,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 529 Invalid, 37 Unknown, 97 Unchecked, 11.2s Time] [2022-11-23 13:52:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-23 13:52:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-11-23 13:52:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.75) internal successors, (70), 42 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2022-11-23 13:52:03,552 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 17 [2022-11-23 13:52:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:03,553 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2022-11-23 13:52:03,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 48 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2022-11-23 13:52:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:52:03,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:03,554 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:03,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-23 13:52:03,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-11-23 13:52:03,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-11-23 13:52:04,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:52:04,163 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:52:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -591918595, now seen corresponding path program 3 times [2022-11-23 13:52:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:52:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880585413] [2022-11-23 13:52:04,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:52:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:52:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:52:04,166 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:52:04,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-23 13:52:04,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 13:52:04,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:52:04,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-23 13:52:04,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:52:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:04,623 INFO L321 Elim1Store]: treesize reduction 140, result has 25.9 percent of original size [2022-11-23 13:52:04,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 81 [2022-11-23 13:52:04,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:04,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 13:52:05,143 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 13:52:05,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 13:52:05,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:05,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:05,272 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-23 13:52:05,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2022-11-23 13:52:06,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:06,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:06,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:06,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:06,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:06,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:07,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:07,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:07,265 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-23 13:52:07,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 16 [2022-11-23 13:52:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 13:52:07,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:52:07,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1| (_ BitVec 32)) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_825) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)) (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|)) (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base|))))) is different from false [2022-11-23 13:52:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 14 not checked. [2022-11-23 13:52:11,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:52:11,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880585413] [2022-11-23 13:52:11,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880585413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:52:11,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [804660520] [2022-11-23 13:52:11,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:52:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:52:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:52:11,493 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:52:11,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-23 13:52:11,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 13:52:11,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358311672] [2022-11-23 13:52:11,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:52:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:52:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:11,944 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:52:11,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 1 [2022-11-23 13:52:11,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-23 13:52:12,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 13:52:12,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:52:12,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 13:52:12,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:52:12,410 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 13:52:12,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-23 13:52:12,489 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:52:12,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:52:12,832 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:52:12,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:52:12,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:52:13,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:13,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:13,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:13,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:13,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:13,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:14,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:14,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:14,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:52:23,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~v~0.base_111 (_ BitVec 32)) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| v_~v~0.base_111))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_885) v_~v~0.base_111 v_ArrVal_892) (_ bv3 32)) (_ bv7 32))) (_ bv0 8)))) is different from false [2022-11-23 13:52:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 7 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:25,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358311672] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:52:25,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-11-23 13:52:25,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 13, 13] total 38 [2022-11-23 13:52:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112242187] [2022-11-23 13:52:25,891 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-11-23 13:52:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-23 13:52:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:52:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-23 13:52:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1161, Unknown=39, NotChecked=142, Total=1482 [2022-11-23 13:52:25,893 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:32,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:52:40,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 13:52:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:50,601 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-11-23 13:52:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 13:52:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 13:52:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:50,604 INFO L225 Difference]: With dead ends: 36 [2022-11-23 13:52:50,604 INFO L226 Difference]: Without dead ends: 36 [2022-11-23 13:52:50,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=501, Invalid=2119, Unknown=40, NotChecked=202, Total=2862 [2022-11-23 13:52:50,605 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 100 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:50,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 396 Invalid, 2 Unknown, 60 Unchecked, 8.5s Time] [2022-11-23 13:52:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-23 13:52:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-11-23 13:52:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-11-23 13:52:50,608 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 17 [2022-11-23 13:52:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:50,608 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-11-23 13:52:50,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-11-23 13:52:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:52:50,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:50,609 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:50,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-11-23 13:52:50,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-11-23 13:52:51,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:52:51,020 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:52:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1751952244, now seen corresponding path program 6 times [2022-11-23 13:52:51,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:52:51,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095426876] [2022-11-23 13:52:51,021 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 13:52:51,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:52:51,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:52:51,022 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:52:51,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-23 13:52:51,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-23 13:52:51,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:52:51,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 13:52:51,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:52:51,428 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:52:51,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:52:51,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:51,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:52:51,599 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:52:51,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:52:51,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:51,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:51,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:52,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:52,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:52,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:52,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:52,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:52:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:57,334 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:52:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095426876] [2022-11-23 13:52:57,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095426876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:52:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1848379557] [2022-11-23 13:52:57,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 13:52:57,335 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 13:52:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 13:52:57,337 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 13:52:57,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-23 13:52:57,923 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-23 13:52:57,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:52:57,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 13:52:57,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:52:58,038 INFO L321 Elim1Store]: treesize reduction 63, result has 33.7 percent of original size [2022-11-23 13:52:58,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 63 [2022-11-23 13:52:58,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:58,267 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 13:52:58,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 13:52:58,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:52:59,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:02,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:03,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:03,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:04,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:04,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:04,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:07,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1848379557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:07,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050888485] [2022-11-23 13:53:07,659 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 13:53:07,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:07,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:07,660 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:07,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-23 13:53:08,081 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-23 13:53:08,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:08,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 13:53:08,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:08,169 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-23 13:53:08,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-23 13:53:08,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,289 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-23 13:53:08,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 13:53:08,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 13:53:08,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 13:53:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:08,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:22,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050888485] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:22,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 13:53:22,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11, 11] total 50 [2022-11-23 13:53:22,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135077631] [2022-11-23 13:53:22,818 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:22,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 13:53:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:22,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 13:53:22,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2128, Unknown=203, NotChecked=0, Total=2550 [2022-11-23 13:53:22,820 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:39,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 13:53:41,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 13:53:42,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 13:53:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:46,349 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-11-23 13:53:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 13:53:46,355 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 13:53:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:46,356 INFO L225 Difference]: With dead ends: 31 [2022-11-23 13:53:46,356 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 13:53:46,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=490, Invalid=3083, Unknown=209, NotChecked=0, Total=3782 [2022-11-23 13:53:46,357 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 88 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:46,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 548 Invalid, 16 Unknown, 0 Unchecked, 11.3s Time] [2022-11-23 13:53:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 13:53:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-23 13:53:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-11-23 13:53:46,359 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 18 [2022-11-23 13:53:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:46,360 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-11-23 13:53:46,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.588235294117647) internal successors, (81), 50 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-11-23 13:53:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 13:53:46,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:46,361 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:46,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:46,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-11-23 13:53:46,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:46,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 13:53:46,963 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-23 13:53:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1523708398, now seen corresponding path program 7 times [2022-11-23 13:53:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:46,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615566314] [2022-11-23 13:53:46,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:53:46,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:53:46,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:46,965 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 13:53:46,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-23 13:53:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:47,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:53:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:47,585 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 13:53:47,585 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:53:47,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2022-11-23 13:53:47,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2022-11-23 13:53:47,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2022-11-23 13:53:47,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2022-11-23 13:53:47,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2022-11-23 13:53:47,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2022-11-23 13:53:47,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2022-11-23 13:53:47,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2022-11-23 13:53:47,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2022-11-23 13:53:47,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2022-11-23 13:53:47,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2022-11-23 13:53:47,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2022-11-23 13:53:47,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2022-11-23 13:53:47,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2022-11-23 13:53:47,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2022-11-23 13:53:47,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2022-11-23 13:53:47,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2022-11-23 13:53:47,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2022-11-23 13:53:47,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2022-11-23 13:53:47,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2022-11-23 13:53:47,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2022-11-23 13:53:47,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2022-11-23 13:53:47,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2022-11-23 13:53:47,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2022-11-23 13:53:47,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2022-11-23 13:53:47,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2022-11-23 13:53:47,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 13:53:47,814 INFO L444 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:47,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:53:47,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:53:47,835 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,852 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,852 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,853 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,854 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,857 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,857 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,858 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,858 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,864 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,865 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,865 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,867 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,867 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,867 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,869 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,869 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,869 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,869 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,871 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,871 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,871 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:53:47,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:53:47,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:53:47,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:53:47,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:53:47,878 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,879 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-23 13:53:47,886 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-23 13:53:47,886 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-23 13:53:47,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:53:47 BasicIcfg [2022-11-23 13:53:47,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:53:47,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:53:47,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:53:47,908 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:53:47,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:48:36" (3/4) ... [2022-11-23 13:53:47,912 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 13:53:47,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:53:47,913 INFO L158 Benchmark]: Toolchain (without parser) took 313132.43ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 47.2MB in the beginning and 66.6MB in the end (delta: -19.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,914 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 71.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:47,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 958.14ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 47.1MB in the beginning and 60.9MB in the end (delta: -13.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.87ms. Allocated memory is still 86.0MB. Free memory was 60.5MB in the beginning and 58.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,915 INFO L158 Benchmark]: Boogie Preprocessor took 41.61ms. Allocated memory is still 86.0MB. Free memory was 58.1MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,915 INFO L158 Benchmark]: RCFGBuilder took 832.23ms. Allocated memory is still 86.0MB. Free memory was 56.0MB in the beginning and 58.6MB in the end (delta: -2.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,915 INFO L158 Benchmark]: TraceAbstraction took 311221.29ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 57.8MB in the beginning and 67.7MB in the end (delta: -9.9MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,916 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 66.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:47,917 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.36ms. Allocated memory is still 71.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 958.14ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 47.1MB in the beginning and 60.9MB in the end (delta: -13.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.87ms. Allocated memory is still 86.0MB. Free memory was 60.5MB in the beginning and 58.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.61ms. Allocated memory is still 86.0MB. Free memory was 58.1MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 832.23ms. Allocated memory is still 86.0MB. Free memory was 56.0MB in the beginning and 58.6MB in the end (delta: -2.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 311221.29ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 57.8MB in the beginning and 67.7MB in the end (delta: -9.9MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 66.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.5s, 122 PlacesBefore, 39 PlacesAfterwards, 120 TransitionsBefore, 34 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 6 FixpointIterations, 80 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 139 TotalNumberOfCompositions, 464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 387, independent conditional: 0, independent unconditional: 387, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 243, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 243, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 243, unknown conditional: 0, unknown unconditional: 243] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1107. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [#in~arg={0:0}, pthread_create(&t1, 0, thread1, 0)=8192, t1={10:0}, t2={17:0}, v={0:0}] [L1123] 0 \read(t1) VAL [#in~arg={0:0}, \read(t1)=8192, t1={10:0}, t2={17:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [#in~arg={0:0}, \read(t1)=8192, \result={0:0}, arg={0:0}, t1={10:0}, t2={17:0}, v={5:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [#in~arg={0:0}, \result={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=8193, t1={10:0}, t2={17:0}, v={5:0}] [L1125] 0 \read(t2) VAL [#in~arg={0:0}, \read(t2)=8193, \result={0:0}, arg={0:0}, t1={10:0}, t2={17:0}, v={5:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [#in~arg={0:0}, \read(t2)=8193, \result={0:0}, arg={0:0}, t1={10:0}, t2={17:0}, v={5:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 153 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 310.9s, OverallIterations: 24, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 142.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.6s, HoareTripleCheckerStatistics: 179 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 66.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1356 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 64.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 315 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3670 IncrementalHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 463 mSolverCounterUnsat, 3 mSDtfsCounter, 3670 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 991 GetRequests, 506 SyntacticMatches, 25 SemanticMatches, 460 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 5486 ImplicationChecksByTransitivity, 184.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 143 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 131.3s InterpolantComputationTime, 532 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 854 ConstructedInterpolants, 423 QuantifiedInterpolants, 17972 SizeOfPredicates, 268 NumberOfNonLiveVariables, 5057 ConjunctsInSsa, 794 ConjunctsInUnsatCore, 71 InterpolantComputations, 13 PerfectInterpolantSequences, 75/562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 13:53:48,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3075151-a789-4dee-9ac1-c0f2dae08176/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample