./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-e04fb08 [2022-11-16 16:17:22,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 16:17:22,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 16:17:22,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 16:17:22,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 16:17:22,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 16:17:22,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 16:17:22,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 16:17:22,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 16:17:22,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 16:17:22,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 16:17:22,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 16:17:22,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 16:17:22,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 16:17:22,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 16:17:22,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 16:17:22,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 16:17:22,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 16:17:22,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 16:17:22,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 16:17:22,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 16:17:22,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 16:17:22,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 16:17:22,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 16:17:22,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 16:17:22,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 16:17:22,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 16:17:22,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 16:17:22,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 16:17:22,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 16:17:22,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 16:17:22,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 16:17:22,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 16:17:22,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 16:17:22,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 16:17:22,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 16:17:22,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 16:17:22,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 16:17:22,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 16:17:22,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 16:17:22,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 16:17:22,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 16:17:22,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 16:17:22,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 16:17:22,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 16:17:22,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 16:17:22,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 16:17:22,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 16:17:22,189 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 16:17:22,189 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 16:17:22,189 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 16:17:22,190 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 16:17:22,191 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 16:17:22,191 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 16:17:22,191 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 16:17:22,192 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 16:17:22,192 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 16:17:22,192 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 16:17:22,192 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 16:17:22,192 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 16:17:22,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 16:17:22,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 16:17:22,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 16:17:22,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 16:17:22,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 16:17:22,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 16:17:22,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 16:17:22,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 16:17:22,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 16:17:22,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 16:17:22,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 16:17:22,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 16:17:22,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 16:17:22,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 16:17:22,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:17:22,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 16:17:22,199 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 16:17:22,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 16:17:22,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 16:17:22,199 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 16:17:22,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 16:17:22,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 16:17:22,200 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 16:17:22,200 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-16 16:17:22,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 16:17:22,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 16:17:22,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 16:17:22,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 16:17:22,493 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 16:17:22,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-16 16:17:22,561 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/735fbf793/2ff9c6f1a253482c83c65596991545d6/FLAGc12159ef6 [2022-11-16 16:17:23,063 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 16:17:23,064 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-16 16:17:23,083 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/735fbf793/2ff9c6f1a253482c83c65596991545d6/FLAGc12159ef6 [2022-11-16 16:17:23,382 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/735fbf793/2ff9c6f1a253482c83c65596991545d6 [2022-11-16 16:17:23,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 16:17:23,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 16:17:23,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 16:17:23,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 16:17:23,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 16:17:23,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312fe95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23, skipping insertion in model container [2022-11-16 16:17:23,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 16:17:23,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 16:17:23,765 WARN L229 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-16 16:17:23,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:17:23,776 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 16:17:23,850 WARN L229 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-16 16:17:23,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:17:23,883 INFO L208 MainTranslator]: Completed translation [2022-11-16 16:17:23,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23 WrapperNode [2022-11-16 16:17:23,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 16:17:23,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 16:17:23,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 16:17:23,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 16:17:23,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,935 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-16 16:17:23,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 16:17:23,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 16:17:23,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 16:17:23,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 16:17:23,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,962 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 16:17:23,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 16:17:23,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 16:17:23,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 16:17:23,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (1/1) ... [2022-11-16 16:17:23,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:17:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:17:24,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 16:17:24,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 16:17:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 16:17:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 16:17:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 16:17:24,075 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 16:17:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 16:17:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 16:17:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 16:17:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 16:17:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 16:17:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 16:17:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 16:17:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 16:17:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 16:17:24,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 16:17:24,234 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 16:17:24,236 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 16:17:24,543 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 16:17:24,609 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 16:17:24,609 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 16:17:24,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:17:24 BoogieIcfgContainer [2022-11-16 16:17:24,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 16:17:24,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 16:17:24,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 16:17:24,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 16:17:24,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:17:23" (1/3) ... [2022-11-16 16:17:24,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7be02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:17:24, skipping insertion in model container [2022-11-16 16:17:24,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:17:23" (2/3) ... [2022-11-16 16:17:24,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7be02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:17:24, skipping insertion in model container [2022-11-16 16:17:24,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:17:24" (3/3) ... [2022-11-16 16:17:24,622 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-16 16:17:24,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 16:17:24,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 16:17:24,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 16:17:24,724 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4720ef62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:17:24,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 16:17:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:17:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 16:17:24,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:17:24,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:17:24,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:17:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:17:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1657314583, now seen corresponding path program 1 times [2022-11-16 16:17:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:17:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507935983] [2022-11-16 16:17:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:17:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:17:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:17:25,250 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-16 16:17:25,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:17:25,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507935983] [2022-11-16 16:17:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507935983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:17:25,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:17:25,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:17:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195637909] [2022-11-16 16:17:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:17:25,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:17:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:17:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:17:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:17:25,301 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 16:17:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:17:25,371 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-11-16 16:17:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:17:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-16 16:17:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:17:25,381 INFO L225 Difference]: With dead ends: 37 [2022-11-16 16:17:25,381 INFO L226 Difference]: Without dead ends: 18 [2022-11-16 16:17:25,384 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-16 16:17:25,388 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 16:17:25,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 16:17:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-16 16:17:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-11-16 16:17:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:17:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-16 16:17:25,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2022-11-16 16:17:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:17:25,427 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-16 16:17:25,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 16:17:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-16 16:17:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 16:17:25,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:17:25,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:17:25,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 16:17:25,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:17:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:17:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash -323849658, now seen corresponding path program 1 times [2022-11-16 16:17:25,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:17:25,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431701179] [2022-11-16 16:17:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:17:25,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:17:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:17:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:17:25,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:17:25,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431701179] [2022-11-16 16:17:25,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431701179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:17:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484034141] [2022-11-16 16:17:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:17:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:17:25,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:17:25,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:17:25,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 16:17:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:17:25,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:17:25,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:17:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:17:25,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:17:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:17:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484034141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:17:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [467842675] [2022-11-16 16:17:25,984 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-16 16:17:25,984 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 16:17:25,988 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 16:17:25,995 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 16:17:25,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 16:17:26,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,121 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:17:26,122 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 16:17:26,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,191 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 16:17:26,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 37 [2022-11-16 16:17:26,291 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-16 16:17:26,300 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 9 [2022-11-16 16:17:26,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 9 [2022-11-16 16:17:26,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 9 [2022-11-16 16:17:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 17 [2022-11-16 16:17:26,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 16:17:26,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 16:17:26,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 16:17:26,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 16:17:26,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:26,654 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 21 treesize of output 13 [2022-11-16 16:17:26,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:26,666 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 21 treesize of output 13 [2022-11-16 16:17:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:26,683 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 27 treesize of output 11 [2022-11-16 16:17:26,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:26,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:26,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:17:26,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:26,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:26,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:26,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:26,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:26,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:26,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:17:27,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:27,087 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 222 treesize of output 202 [2022-11-16 16:17:27,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:27,106 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 0 case distinctions, treesize of input 216 treesize of output 204 [2022-11-16 16:17:27,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:27,125 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 0 case distinctions, treesize of input 220 treesize of output 208 [2022-11-16 16:17:27,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:17:27,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:27,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:27,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:27,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:27,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:27,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:27,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:27,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:27,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:17:27,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:27,502 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 222 treesize of output 202 [2022-11-16 16:17:27,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:27,523 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 0 case distinctions, treesize of input 216 treesize of output 204 [2022-11-16 16:17:27,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:27,542 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 0 case distinctions, treesize of input 220 treesize of output 208 [2022-11-16 16:17:27,807 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 7 treesize of output 3 [2022-11-16 16:17:27,830 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 7 treesize of output 3 [2022-11-16 16:17:27,953 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 7 treesize of output 3 [2022-11-16 16:17:27,976 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 7 treesize of output 3 [2022-11-16 16:17:28,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:28,172 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-16 16:17:28,173 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 236 treesize of output 212 [2022-11-16 16:17:28,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2022-11-16 16:17:28,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:28,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:28,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:17:28,219 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 249 treesize of output 224 [2022-11-16 16:17:28,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:28,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:28,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:17:28,255 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 241 treesize of output 216 [2022-11-16 16:17:28,473 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-16 16:17:28,480 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-16 16:17:28,490 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 9 [2022-11-16 16:17:28,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:28,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 17 [2022-11-16 16:17:28,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:28,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 9 [2022-11-16 16:17:28,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:28,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 9 [2022-11-16 16:17:28,529 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 16:17:31,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [467842675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:17:31,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:17:31,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 13 [2022-11-16 16:17:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636884258] [2022-11-16 16:17:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:17:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 16:17:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:17:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 16:17:31,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-16 16:17:31,431 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:17:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:17:31,783 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-11-16 16:17:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 16:17:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-16 16:17:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:17:31,786 INFO L225 Difference]: With dead ends: 22 [2022-11-16 16:17:31,786 INFO L226 Difference]: Without dead ends: 17 [2022-11-16 16:17:31,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-16 16:17:31,787 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 16:17:31,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 16:17:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-16 16:17:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-16 16:17:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:17:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-16 16:17:31,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 17 [2022-11-16 16:17:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:17:31,804 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-16 16:17:31,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:17:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-16 16:17:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 16:17:31,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:17:31,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:17:31,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 16:17:32,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:17:32,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:17:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:17:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1525107315, now seen corresponding path program 1 times [2022-11-16 16:17:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:17:32,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444667928] [2022-11-16 16:17:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:17:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:17:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:17:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 16:17:32,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:17:32,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444667928] [2022-11-16 16:17:32,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444667928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:17:32,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316005169] [2022-11-16 16:17:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:17:32,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:17:32,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:17:32,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:17:32,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 16:17:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:17:32,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:17:32,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:17:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:17:32,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:17:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 16:17:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316005169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:17:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019940936] [2022-11-16 16:17:32,390 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-16 16:17:32,390 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 16:17:32,390 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 16:17:32,391 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 16:17:32,391 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 16:17:32,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,445 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:17:32,445 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 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 16:17:32,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,475 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 16:17:32,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 37 [2022-11-16 16:17:32,528 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-16 16:17:32,533 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 9 [2022-11-16 16:17:32,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 9 [2022-11-16 16:17:32,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 17 [2022-11-16 16:17:32,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 9 [2022-11-16 16:17:32,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 16:17:32,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 16:17:32,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 16:17:32,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 16:17:32,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:32,750 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 21 treesize of output 13 [2022-11-16 16:17:32,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:32,761 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 27 treesize of output 11 [2022-11-16 16:17:32,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:32,776 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 21 treesize of output 13 [2022-11-16 16:17:32,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:17:32,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:32,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:32,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:32,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:32,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:32,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-16 16:17:32,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:32,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:17:32,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-16 16:17:33,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 16:17:33,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 16:17:33,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2022-11-16 16:17:33,169 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 76 treesize of output 58 [2022-11-16 16:17:33,181 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 51 treesize of output 45 [2022-11-16 16:17:33,305 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 57 treesize of output 51 [2022-11-16 16:17:33,316 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 70 treesize of output 52 [2022-11-16 16:17:33,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2022-11-16 16:17:33,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 16:17:33,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 16:17:33,596 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 7 treesize of output 3 [2022-11-16 16:17:33,607 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 7 treesize of output 3 [2022-11-16 16:17:33,709 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 7 treesize of output 3 [2022-11-16 16:17:33,721 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 7 treesize of output 3 [2022-11-16 16:17:33,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 112 [2022-11-16 16:17:33,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 94 [2022-11-16 16:17:33,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2022-11-16 16:17:34,873 INFO L321 Elim1Store]: treesize reduction 144, result has 36.0 percent of original size [2022-11-16 16:17:34,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 265 treesize of output 473 [2022-11-16 16:17:34,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:17:35,017 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 21 treesize of output 17 [2022-11-16 16:17:35,088 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 10 treesize of output 9 [2022-11-16 16:17:35,150 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 10 treesize of output 9 [2022-11-16 16:17:35,181 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 10 treesize of output 9 [2022-11-16 16:17:35,287 INFO L321 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2022-11-16 16:17:35,287 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2022-11-16 16:17:35,489 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 10 treesize of output 9 [2022-11-16 16:17:35,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:35,569 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 26 treesize of output 27 [2022-11-16 16:17:35,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:35,602 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 26 treesize of output 27 [2022-11-16 16:17:35,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:35,638 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 16 treesize of output 20 [2022-11-16 16:17:35,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:35,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:35,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:36,255 INFO L321 Elim1Store]: treesize reduction 82, result has 43.8 percent of original size [2022-11-16 16:17:36,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 1027 treesize of output 1537 [2022-11-16 16:17:38,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:38,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:38,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:38,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:38,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:38,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:38,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:38,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 3376 [2022-11-16 16:17:39,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:17:39,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 923 treesize of output 5962 [2022-11-16 16:17:39,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:39,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:40,150 INFO L321 Elim1Store]: treesize reduction 129, result has 7.9 percent of original size [2022-11-16 16:17:40,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 2411 treesize of output 4271 [2022-11-16 16:17:41,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:41,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:42,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:42,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:42,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:42,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:42,533 INFO L217 Elim1Store]: Index analysis took 1493 ms [2022-11-16 16:17:42,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2782 treesize of output 7614 [2022-11-16 16:17:43,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:17:43,521 INFO L217 Elim1Store]: Index analysis took 159 ms [2022-11-16 16:17:43,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 624 treesize of output 4185 [2022-11-16 16:18:05,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1125 treesize of output 3111 [2022-11-16 16:18:05,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:05,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:06,151 INFO L321 Elim1Store]: treesize reduction 180, result has 5.8 percent of original size [2022-11-16 16:18:06,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 4456 treesize of output 7056 [2022-11-16 16:18:08,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:18:08,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:08,921 INFO L217 Elim1Store]: Index analysis took 392 ms [2022-11-16 16:18:08,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 14 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 9075 treesize of output 39530 [2022-11-16 16:18:09,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:18:09,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:09,985 INFO L217 Elim1Store]: Index analysis took 352 ms [2022-11-16 16:18:10,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 14 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 13138 treesize of output 43109 [2022-11-16 16:18:10,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:10,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 22450 treesize of output 24955 [2022-11-16 16:18:14,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:14,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 22443 treesize of output 24950 [2022-11-16 16:18:17,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:17,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 22443 treesize of output 24950 [2022-11-16 16:18:53,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:53,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:53,984 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-16 16:18:53,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:53,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,003 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-16 16:18:54,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,037 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-16 16:18:54,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:18:54,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 3395 [2022-11-16 16:18:54,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,381 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-16 16:18:54,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,399 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-16 16:18:54,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 953 treesize of output 3570 [2022-11-16 16:18:54,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1125 treesize of output 3111 [2022-11-16 16:18:54,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:54,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 953 treesize of output 3570 [2022-11-16 16:18:55,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1125 treesize of output 3111 [2022-11-16 16:18:55,782 INFO L321 Elim1Store]: treesize reduction 117, result has 17.6 percent of original size [2022-11-16 16:18:55,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 245 treesize of output 332 [2022-11-16 16:18:55,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:55,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:56,235 INFO L321 Elim1Store]: treesize reduction 66, result has 46.3 percent of original size [2022-11-16 16:18:56,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 622 treesize of output 946 [2022-11-16 16:18:56,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:56,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:56,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:56,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:56,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:56,613 INFO L217 Elim1Store]: Index analysis took 198 ms [2022-11-16 16:18:56,637 INFO L321 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2022-11-16 16:18:56,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 236 treesize of output 824 [2022-11-16 16:18:59,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 611 treesize of output 929 [2022-11-16 16:18:59,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:18:59,548 INFO L217 Elim1Store]: Index analysis took 135 ms [2022-11-16 16:18:59,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 626 [2022-11-16 16:19:10,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,914 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-16 16:19:10,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:10,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:10,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:10,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 2159 [2022-11-16 16:19:11,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,086 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2022-11-16 16:19:11,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:11,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:11,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 2156 [2022-11-16 16:19:11,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 115 [2022-11-16 16:19:11,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:11,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:11,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 2146 [2022-11-16 16:19:11,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,669 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2022-11-16 16:19:11,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:11,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:11,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 2156 [2022-11-16 16:19:11,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:11,967 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2022-11-16 16:19:12,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 2159 [2022-11-16 16:19:12,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2022-11-16 16:19:12,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-16 16:19:12,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:12,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:12,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 11314 [2022-11-16 16:19:13,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:13,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:13,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:13,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:13,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:13,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:13,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-16 16:19:14,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:14,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:14,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:14,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:14,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:14,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:14,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 11314 [2022-11-16 16:19:14,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:14,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:14,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:14,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:14,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:14,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:14,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 750 treesize of output 11304 [2022-11-16 16:19:15,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:15,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:15,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:15,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:15,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:15,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:15,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-16 16:19:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:16,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:16,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:16,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:16,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:16,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:16,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 755 treesize of output 11307 [2022-11-16 16:19:16,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:16,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:16,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:16,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:16,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:16,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:16,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 11320 [2022-11-16 16:19:17,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:17,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:17,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:17,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:17,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:17,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:19:17,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-16 16:19:23,340 INFO L217 Elim1Store]: Index analysis took 578 ms [2022-11-16 16:19:47,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 16:19:47,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:19:47,712 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178921 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java: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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178921 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 68 more [2022-11-16 16:19:47,716 INFO L158 Benchmark]: Toolchain (without parser) took 144330.54ms. Allocated memory was 119.5MB in the beginning and 10.4GB in the end (delta: 10.2GB). Free memory was 77.9MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2022-11-16 16:19:47,716 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 16:19:47,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.04ms. Allocated memory is still 119.5MB. Free memory was 77.7MB in the beginning and 88.7MB in the end (delta: -11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 16:19:47,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 119.5MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 16:19:47,717 INFO L158 Benchmark]: Boogie Preprocessor took 30.25ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 85.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 16:19:47,717 INFO L158 Benchmark]: RCFGBuilder took 645.34ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 65.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 16:19:47,717 INFO L158 Benchmark]: TraceAbstraction took 143100.93ms. Allocated memory was 119.5MB in the beginning and 10.4GB in the end (delta: 10.2GB). Free memory was 64.5MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-16 16:19:47,718 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 119.5MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.04ms. Allocated memory is still 119.5MB. Free memory was 77.7MB in the beginning and 88.7MB in the end (delta: -11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 119.5MB. Free memory was 88.7MB in the beginning and 86.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.25ms. Allocated memory is still 119.5MB. Free memory was 86.6MB in the beginning and 85.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 645.34ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 65.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 143100.93ms. Allocated memory was 119.5MB in the beginning and 10.4GB in the end (delta: 10.2GB). Free memory was 64.5MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178921 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178921 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-16 16:19:47,935 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-16 16:19:47,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-e04fb08 [2022-11-16 16:19:50,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 16:19:50,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 16:19:50,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 16:19:50,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 16:19:50,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 16:19:50,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 16:19:50,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 16:19:50,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 16:19:50,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 16:19:50,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 16:19:50,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 16:19:50,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 16:19:50,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 16:19:50,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 16:19:50,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 16:19:50,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 16:19:50,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 16:19:50,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 16:19:50,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 16:19:50,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 16:19:50,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 16:19:50,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 16:19:50,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 16:19:50,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 16:19:50,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 16:19:50,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 16:19:50,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 16:19:50,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 16:19:50,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 16:19:50,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 16:19:50,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 16:19:50,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 16:19:50,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 16:19:50,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 16:19:50,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 16:19:50,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 16:19:50,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 16:19:50,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 16:19:50,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 16:19:50,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 16:19:50,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-16 16:19:50,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 16:19:50,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 16:19:50,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 16:19:50,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 16:19:50,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 16:19:50,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 16:19:50,360 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 16:19:50,360 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 16:19:50,361 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 16:19:50,361 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 16:19:50,361 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 16:19:50,361 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 16:19:50,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 16:19:50,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 16:19:50,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 16:19:50,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 16:19:50,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 16:19:50,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 16:19:50,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 16:19:50,364 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 16:19:50,364 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 16:19:50,364 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 16:19:50,365 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 16:19:50,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 16:19:50,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 16:19:50,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 16:19:50,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 16:19:50,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 16:19:50,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 16:19:50,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:19:50,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 16:19:50,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 16:19:50,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 16:19:50,367 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-16 16:19:50,368 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 16:19:50,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 16:19:50,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 16:19:50,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 16:19:50,368 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-16 16:19:50,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 16:19:50,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 16:19:50,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 16:19:50,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 16:19:50,832 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 16:19:50,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-16 16:19:50,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/504ca0518/0010ec2628b242f88bb707b6cb2212ba/FLAG2e3cdc666 [2022-11-16 16:19:51,565 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 16:19:51,566 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-16 16:19:51,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/504ca0518/0010ec2628b242f88bb707b6cb2212ba/FLAG2e3cdc666 [2022-11-16 16:19:51,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/data/504ca0518/0010ec2628b242f88bb707b6cb2212ba [2022-11-16 16:19:51,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 16:19:51,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 16:19:51,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 16:19:51,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 16:19:51,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 16:19:51,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:19:51" (1/1) ... [2022-11-16 16:19:51,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5c6b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:51, skipping insertion in model container [2022-11-16 16:19:51,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:19:51" (1/1) ... [2022-11-16 16:19:51,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 16:19:51,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 16:19:52,317 WARN L229 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-16 16:19:52,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:19:52,346 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 16:19:52,419 WARN L229 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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-16 16:19:52,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:19:52,471 INFO L208 MainTranslator]: Completed translation [2022-11-16 16:19:52,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52 WrapperNode [2022-11-16 16:19:52,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 16:19:52,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 16:19:52,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 16:19:52,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 16:19:52,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,553 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-11-16 16:19:52,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 16:19:52,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 16:19:52,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 16:19:52,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 16:19:52,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 16:19:52,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 16:19:52,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 16:19:52,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 16:19:52,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (1/1) ... [2022-11-16 16:19:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:19:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:19:52,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 16:19:52,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 16:19:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 16:19:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 16:19:52,724 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 16:19:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 16:19:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 16:19:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 16:19:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 16:19:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 16:19:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 16:19:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 16:19:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 16:19:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 16:19:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 16:19:52,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 16:19:52,927 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 16:19:52,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 16:19:53,294 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 16:19:53,301 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 16:19:53,301 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 16:19:53,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:19:53 BoogieIcfgContainer [2022-11-16 16:19:53,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 16:19:53,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 16:19:53,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 16:19:53,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 16:19:53,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:19:51" (1/3) ... [2022-11-16 16:19:53,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57089a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:19:53, skipping insertion in model container [2022-11-16 16:19:53,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:52" (2/3) ... [2022-11-16 16:19:53,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57089a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:19:53, skipping insertion in model container [2022-11-16 16:19:53,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:19:53" (3/3) ... [2022-11-16 16:19:53,322 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-16 16:19:53,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 16:19:53,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 16:19:53,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 16:19:53,411 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b855941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:19:53,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 16:19:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:19:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 16:19:53,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:19:53,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:19:53,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:19:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:19:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-11-16 16:19:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:19:53,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977071348] [2022-11-16 16:19:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:53,449 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-16 16:19:53,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:19:53,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:53,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:53,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 16:19:53,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:53,647 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-16 16:19:53,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 16:19:53,649 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:19:53,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977071348] [2022-11-16 16:19:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977071348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:19:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:19:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:19:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116645718] [2022-11-16 16:19:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:19:53,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 16:19:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:19:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 16:19:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 16:19:53,708 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 16:19:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:19:53,757 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-11-16 16:19:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:19:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-16 16:19:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:19:53,768 INFO L225 Difference]: With dead ends: 54 [2022-11-16 16:19:53,768 INFO L226 Difference]: Without dead ends: 24 [2022-11-16 16:19:53,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-16 16:19:53,775 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 16:19:53,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 16:19:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-16 16:19:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-16 16:19:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:19:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-16 16:19:53,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-11-16 16:19:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:19:53,821 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-16 16:19:53,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 16:19:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-16 16:19:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 16:19:53,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:19:53,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:19:53,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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)] Forceful destruction successful, exit code 0 [2022-11-16 16:19:54,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:19:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:19:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-11-16 16:19:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:19:54,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959216848] [2022-11-16 16:19:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:54,071 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-16 16:19:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:19:54,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:54,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 16:19:54,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:54,252 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-16 16:19:54,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 16:19:54,253 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:19:54,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959216848] [2022-11-16 16:19:54,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959216848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:19:54,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:19:54,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:19:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740699284] [2022-11-16 16:19:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:19:54,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:19:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:19:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:19:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:19:54,257 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 16:19:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:19:54,275 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-16 16:19:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:19:54,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-16 16:19:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:19:54,277 INFO L225 Difference]: With dead ends: 46 [2022-11-16 16:19:54,277 INFO L226 Difference]: Without dead ends: 28 [2022-11-16 16:19:54,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-16 16:19:54,279 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 16:19:54,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 16:19:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-16 16:19:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-11-16 16:19:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:19:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-16 16:19:54,287 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-11-16 16:19:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:19:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-16 16:19:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 16:19:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-16 16:19:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 16:19:54,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:19:54,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:19:54,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:19:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:19:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-11-16 16:19:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:19:54,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268678290] [2022-11-16 16:19:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:54,508 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-16 16:19:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:19:54,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:54,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:19:54,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:19:54,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:19:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 16:19:54,861 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:19:54,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268678290] [2022-11-16 16:19:54,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268678290] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:19:54,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1982695059] [2022-11-16 16:19:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:19:54,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:19:54,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:19:54,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-16 16:19:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:55,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 16:19:55,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 16:19:55,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 16:19:55,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1982695059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:19:55,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 16:19:55,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2022-11-16 16:19:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660908555] [2022-11-16 16:19:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:19:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:19:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:19:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:19:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:19:55,121 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 16:19:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:19:55,174 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-16 16:19:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:19:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-16 16:19:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:19:55,176 INFO L225 Difference]: With dead ends: 41 [2022-11-16 16:19:55,176 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 16:19:55,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:19:55,177 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 16:19:55,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 16:19:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 16:19:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-11-16 16:19:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:19:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-16 16:19:55,184 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 28 [2022-11-16 16:19:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:19:55,184 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-16 16:19:55,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 16:19:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-16 16:19:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 16:19:55,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:19:55,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:19:55,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-16 16:19:55,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:55,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:55,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:19:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:19:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash 265433282, now seen corresponding path program 1 times [2022-11-16 16:19:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:19:55,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446843871] [2022-11-16 16:19:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:55,591 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-16 16:19:55,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:19:55,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:55,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:55,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:19:55,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:19:55,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:19:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 16:19:55,881 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:19:55,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446843871] [2022-11-16 16:19:55,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446843871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:19:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1019591738] [2022-11-16 16:19:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:19:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:19:55,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:19:55,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-16 16:19:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:56,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:19:56,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:19:56,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:19:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 16:19:56,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1019591738] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:19:56,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524856504] [2022-11-16 16:19:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:56,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:19:56,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:19:56,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:19:56,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 16:19:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:56,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 16:19:56,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:19:56,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:19:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 16:19:56,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524856504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:19:56,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-16 16:19:56,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2022-11-16 16:19:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455314633] [2022-11-16 16:19:56,511 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-16 16:19:56,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 16:19:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:19:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 16:19:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:19:56,516 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 16:19:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:19:56,639 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-11-16 16:19:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 16:19:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-16 16:19:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:19:56,641 INFO L225 Difference]: With dead ends: 59 [2022-11-16 16:19:56,641 INFO L226 Difference]: Without dead ends: 39 [2022-11-16 16:19:56,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 16:19:56,642 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:19:56,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 89 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:19:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-16 16:19:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-16 16:19:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:19:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-11-16 16:19:56,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2022-11-16 16:19:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:19:56,655 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-11-16 16:19:56,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 16:19:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-11-16 16:19:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 16:19:56,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:19:56,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:19:56,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:56,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-16 16:19:57,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 16:19:57,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:19:57,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:19:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:19:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 2 times [2022-11-16 16:19:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:19:57,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499144014] [2022-11-16 16:19:57,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 16:19:57,273 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-16 16:19:57,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:19:57,274 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:57,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:57,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 16:19:57,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:19:57,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 16:19:57,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:19:57,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 16:19:57,499 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:19:57,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499144014] [2022-11-16 16:19:57,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499144014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:19:57,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:19:57,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:19:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746179714] [2022-11-16 16:19:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:19:57,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:19:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:19:57,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:19:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:19:57,507 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:19:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:19:57,572 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-11-16 16:19:57,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:19:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-16 16:19:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:19:57,575 INFO L225 Difference]: With dead ends: 46 [2022-11-16 16:19:57,575 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 16:19:57,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 16:19:57,576 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 16:19:57,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 16:19:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 16:19:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 16:19:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:19:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-11-16 16:19:57,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 37 [2022-11-16 16:19:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:19:57,603 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-11-16 16:19:57,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 16:19:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-11-16 16:19:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 16:19:57,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:19:57,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:19:57,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:57,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:57,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:19:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:19:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-11-16 16:19:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:19:57,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799817973] [2022-11-16 16:19:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:19:57,810 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-16 16:19:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:19:57,811 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:57,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:19:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:19:58,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 16:19:58,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:19:58,390 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 6 treesize of output 5 [2022-11-16 16:19:58,597 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 16 treesize of output 8 [2022-11-16 16:19:58,824 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (bvult v_arrayElimCell_1 |c_#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_398) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-16 16:19:58,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:58,916 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 22 treesize of output 22 [2022-11-16 16:19:59,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:19:59,403 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-16 16:19:59,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:19:59,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 22 treesize of output 22 [2022-11-16 16:19:59,902 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 23 treesize of output 11 [2022-11-16 16:20:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-11-16 16:20:00,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:20:00,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-16 16:20:00,809 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:20:00,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799817973] [2022-11-16 16:20:00,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799817973] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:20:00,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [318510946] [2022-11-16 16:20:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:20:00,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:20:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:20:00,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:20:00,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-16 16:20:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:20:01,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 16:20:01,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:20:02,229 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-11-16 16:20:02,230 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2022-11-16 16:20:02,270 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:20:02,270 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 54 treesize of output 56 [2022-11-16 16:20:02,326 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 38 treesize of output 32 [2022-11-16 16:20:02,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:02,886 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 16:20:02,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2022-11-16 16:20:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:02,906 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 61 treesize of output 61 [2022-11-16 16:20:05,511 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 114 treesize of output 98 [2022-11-16 16:20:05,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:20:05,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 89 [2022-11-16 16:20:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 16:20:06,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:20:06,212 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_470) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-16 16:20:06,837 INFO L321 Elim1Store]: treesize reduction 21, result has 65.0 percent of original size [2022-11-16 16:20:06,837 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 79 [2022-11-16 16:20:06,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:20:06,869 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 172 treesize of output 163 [2022-11-16 16:20:06,888 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 114 treesize of output 110 [2022-11-16 16:20:06,903 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 110 treesize of output 102 [2022-11-16 16:20:06,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:20:06,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 78 [2022-11-16 16:20:07,021 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 20 treesize of output 18 [2022-11-16 16:20:08,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [318510946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:20:08,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212252145] [2022-11-16 16:20:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:20:08,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:20:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:20:08,134 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:20:08,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 16:20:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:20:08,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 16:20:08,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:20:08,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-16 16:20:08,553 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 7 treesize of output 5 [2022-11-16 16:20:08,957 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 16:20:08,958 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 14 treesize of output 20 [2022-11-16 16:20:09,336 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 7 treesize of output 5 [2022-11-16 16:20:09,676 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 16:20:09,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 13 [2022-11-16 16:20:10,574 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 17 treesize of output 9 [2022-11-16 16:20:11,196 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:20:11,196 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 27 [2022-11-16 16:20:11,210 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 13 treesize of output 9 [2022-11-16 16:20:12,180 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:20:12,180 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-16 16:20:12,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:12,503 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 23 treesize of output 23 [2022-11-16 16:20:12,758 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 24 treesize of output 12 [2022-11-16 16:20:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:20:12,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:20:14,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212252145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:20:14,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:20:14,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 22] total 47 [2022-11-16 16:20:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163901267] [2022-11-16 16:20:14,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:20:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 16:20:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:20:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 16:20:14,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3277, Unknown=125, NotChecked=360, Total=4032 [2022-11-16 16:20:14,354 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 47 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 16:20:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:20:18,619 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-11-16 16:20:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 16:20:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2022-11-16 16:20:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:20:18,621 INFO L225 Difference]: With dead ends: 47 [2022-11-16 16:20:18,621 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 16:20:18,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=435, Invalid=4996, Unknown=131, NotChecked=444, Total=6006 [2022-11-16 16:20:18,624 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:20:18,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 285 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 117 Unchecked, 0.5s Time] [2022-11-16 16:20:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 16:20:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-11-16 16:20:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:20:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-11-16 16:20:18,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 38 [2022-11-16 16:20:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:20:18,636 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-11-16 16:20:18,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 16:20:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-11-16 16:20:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 16:20:18,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:20:18,638 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:20:18,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:20:18,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 16:20:19,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-16 16:20:19,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt [2022-11-16 16:20:19,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:20:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:20:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2022-11-16 16:20:19,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:20:19,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362802396] [2022-11-16 16:20:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:20:19,255 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-16 16:20:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:20:19,256 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:20:19,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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)] Waiting until timeout for monitored process [2022-11-16 16:20:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:20:19,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 16:20:19,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:20:19,708 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-16 16:20:19,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-16 16:20:19,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-16 16:20:19,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:19,953 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 21 treesize of output 20 [2022-11-16 16:20:20,285 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 30 treesize of output 18 [2022-11-16 16:20:20,299 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 7 treesize of output 5 [2022-11-16 16:20:20,305 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 7 treesize of output 3 [2022-11-16 16:20:20,314 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 7 treesize of output 3 [2022-11-16 16:20:20,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:20,675 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 36 treesize of output 34 [2022-11-16 16:20:20,732 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 16:20:20,732 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 18 treesize of output 28 [2022-11-16 16:20:20,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:20:20,767 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-16 16:20:20,768 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 17 treesize of output 17 [2022-11-16 16:20:20,812 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:20:20,812 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 16:20:20,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:20:21,419 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:20:21,420 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-11-16 16:20:21,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:21,447 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 37 treesize of output 32 [2022-11-16 16:20:21,482 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 16:20:21,482 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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-16 16:20:21,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:20:21,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:21,832 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 33 treesize of output 31 [2022-11-16 16:20:21,843 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 18 treesize of output 20 [2022-11-16 16:20:21,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:21,864 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-16 16:20:22,170 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 34 treesize of output 18 [2022-11-16 16:20:22,178 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 15 treesize of output 7 [2022-11-16 16:20:22,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-16 16:20:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:20:22,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:20:22,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_617) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 16:20:27,606 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:20:27,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362802396] [2022-11-16 16:20:27,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362802396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:20:27,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1397745025] [2022-11-16 16:20:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:20:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:20:27,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:20:27,608 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:20:27,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-16 16:20:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:20:28,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 16:20:28,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:20:28,330 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-16 16:20:28,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-16 16:20:28,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:28,705 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 21 treesize of output 20 [2022-11-16 16:20:29,387 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 30 treesize of output 18 [2022-11-16 16:20:29,392 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 7 treesize of output 3 [2022-11-16 16:20:29,403 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 7 treesize of output 3 [2022-11-16 16:20:29,409 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 7 treesize of output 5 [2022-11-16 16:20:29,685 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-16 16:20:30,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:30,067 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 36 treesize of output 34 [2022-11-16 16:20:30,105 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-16 16:20:30,105 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 17 treesize of output 17 [2022-11-16 16:20:30,118 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 18 treesize of output 20 [2022-11-16 16:20:30,170 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:20:30,170 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 16:20:30,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:20:31,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:20:31,358 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2022-11-16 16:20:31,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:31,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-16 16:20:31,416 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 16:20:31,417 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-11-16 16:20:31,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:31,825 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 33 treesize of output 31 [2022-11-16 16:20:31,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 16:20:31,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:31,869 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-16 16:20:32,418 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 34 treesize of output 18 [2022-11-16 16:20:32,426 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 15 treesize of output 7 [2022-11-16 16:20:32,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 16:20:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:20:32,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:20:32,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_709)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 16:20:48,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:20:48,439 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 160 [2022-11-16 16:20:55,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1397745025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:20:55,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712912356] [2022-11-16 16:20:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:20:55,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:20:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:20:55,869 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:20:55,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 16:20:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:20:56,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-16 16:20:56,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:20:56,116 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-16 16:20:56,401 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 7 treesize of output 5 [2022-11-16 16:20:56,690 WARN L855 $PredicateComparison]: unable to prove that (and (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_785 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_785) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2022-11-16 16:20:56,784 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 16:20:56,785 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 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 16:20:56,864 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 7 treesize of output 5 [2022-11-16 16:20:57,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-16 16:20:57,752 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 16:20:57,752 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 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 16:20:58,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:20:58,165 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 21 treesize of output 20 [2022-11-16 16:20:59,375 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 20 treesize of output 12 [2022-11-16 16:20:59,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:20:59,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 16:21:00,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:00,048 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 37 treesize of output 35 [2022-11-16 16:21:00,094 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 16:21:00,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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-16 16:21:00,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:21:00,172 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 16:21:00,173 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 24 treesize of output 26 [2022-11-16 16:21:00,249 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-16 16:21:02,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:21:02,424 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-11-16 16:21:02,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:02,437 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 37 treesize of output 32 [2022-11-16 16:21:02,444 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 18 treesize of output 20 [2022-11-16 16:21:03,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:03,210 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 34 treesize of output 32 [2022-11-16 16:21:03,224 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 18 treesize of output 20 [2022-11-16 16:21:03,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:03,251 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-16 16:21:04,355 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 35 treesize of output 19 [2022-11-16 16:21:04,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-16 16:21:04,816 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 15 treesize of output 7 [2022-11-16 16:21:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-11-16 16:21:04,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:04,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_801) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 16:21:09,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_797 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)) v_ArrVal_797)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_801) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_796) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-16 16:21:23,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712912356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:21:23,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:21:23,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 50 [2022-11-16 16:21:23,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282049465] [2022-11-16 16:21:23,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:21:23,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 16:21:23,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:21:23,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 16:21:23,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3330, Unknown=196, NotChecked=620, Total=4422 [2022-11-16 16:21:23,956 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 50 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 41 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 16:21:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:21:30,384 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-11-16 16:21:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 16:21:30,386 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 41 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 38 [2022-11-16 16:21:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:21:30,387 INFO L225 Difference]: With dead ends: 47 [2022-11-16 16:21:30,387 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 16:21:30,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 61.9s TimeCoverageRelationStatistics Valid=354, Invalid=4162, Unknown=196, NotChecked=690, Total=5402 [2022-11-16 16:21:30,389 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:21:30,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 243 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 234 Invalid, 0 Unknown, 74 Unchecked, 1.5s Time] [2022-11-16 16:21:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 16:21:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-11-16 16:21:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:21:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-11-16 16:21:30,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 38 [2022-11-16 16:21:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:21:30,403 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-11-16 16:21:30,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 41 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 16:21:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-11-16 16:21:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 16:21:30,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:21:30,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:21:30,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:30,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:30,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:31,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt [2022-11-16 16:21:31,011 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:21:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:21:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1514635853, now seen corresponding path program 1 times [2022-11-16 16:21:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:21:31,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656715717] [2022-11-16 16:21:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:21:31,012 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-16 16:21:31,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:21:31,013 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:21:31,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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 (16)] Waiting until timeout for monitored process [2022-11-16 16:21:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:21:31,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 16:21:31,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:31,828 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 8 treesize of output 4 [2022-11-16 16:21:32,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:32,184 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-16 16:21:32,316 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 16 treesize of output 8 [2022-11-16 16:21:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:21:32,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:32,803 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:21:32,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656715717] [2022-11-16 16:21:32,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656715717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:21:32,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1990761015] [2022-11-16 16:21:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:21:32,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:21:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:21:32,806 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:21:32,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-16 16:21:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:21:33,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 16:21:33,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:34,193 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 8 treesize of output 4 [2022-11-16 16:21:34,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:34,373 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-16 16:21:34,548 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 16 treesize of output 8 [2022-11-16 16:21:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:21:34,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:34,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1990761015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:21:34,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668522001] [2022-11-16 16:21:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:21:34,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:21:34,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:21:34,943 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:21:34,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 16:21:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:21:35,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 16:21:35,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:36,645 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:21:36,646 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 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-16 16:21:36,656 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 6 treesize of output 4 [2022-11-16 16:21:37,696 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 19 treesize of output 11 [2022-11-16 16:21:37,930 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 19 treesize of output 18 [2022-11-16 16:21:38,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-16 16:21:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:21:38,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:40,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668522001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:21:40,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:21:40,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 38 [2022-11-16 16:21:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240079002] [2022-11-16 16:21:40,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:21:40,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 16:21:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:21:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 16:21:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1886, Unknown=9, NotChecked=0, Total=2070 [2022-11-16 16:21:40,442 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 38 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 30 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 16:21:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:21:43,436 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-11-16 16:21:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 16:21:43,436 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 30 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 38 [2022-11-16 16:21:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:21:43,437 INFO L225 Difference]: With dead ends: 56 [2022-11-16 16:21:43,437 INFO L226 Difference]: Without dead ends: 49 [2022-11-16 16:21:43,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=281, Invalid=2679, Unknown=10, NotChecked=0, Total=2970 [2022-11-16 16:21:43,439 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:21:43,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 355 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 241 Invalid, 0 Unknown, 30 Unchecked, 1.5s Time] [2022-11-16 16:21:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-16 16:21:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-11-16 16:21:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:21:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-11-16 16:21:43,454 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 38 [2022-11-16 16:21:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:21:43,454 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-11-16 16:21:43,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 30 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-16 16:21:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-11-16 16:21:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 16:21:43,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:21:43,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:21:43,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:43,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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 (16)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:43,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:44,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:21:44,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:21:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:21:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1501962780, now seen corresponding path program 2 times [2022-11-16 16:21:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:21:44,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008915955] [2022-11-16 16:21:44,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 16:21:44,062 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-16 16:21:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:21:44,063 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:21:44,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:21:44,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 16:21:44,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:21:44,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:21:44,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:21:44,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:21:45,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:21:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008915955] [2022-11-16 16:21:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008915955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:21:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1564016004] [2022-11-16 16:21:45,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 16:21:45,360 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:21:45,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:21:45,363 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:21:45,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-16 16:21:45,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 16:21:45,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:21:45,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:21:45,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:21:45,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:21:46,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1564016004] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:21:46,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92039183] [2022-11-16 16:21:46,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 16:21:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:21:46,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:21:46,422 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:21:46,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 16:21:46,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 16:21:46,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:21:46,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 16:21:46,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:21:46,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 16:21:47,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92039183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:21:47,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-16 16:21:47,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-16 16:21:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819727951] [2022-11-16 16:21:47,362 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-16 16:21:47,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 16:21:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:21:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 16:21:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 16:21:47,363 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 16:21:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:21:47,502 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-16 16:21:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 16:21:47,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2022-11-16 16:21:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:21:47,504 INFO L225 Difference]: With dead ends: 49 [2022-11-16 16:21:47,504 INFO L226 Difference]: Without dead ends: 40 [2022-11-16 16:21:47,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 16:21:47,505 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:21:47,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 97 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:21:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-16 16:21:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-16 16:21:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:21:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-16 16:21:47,518 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 39 [2022-11-16 16:21:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:21:47,519 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-16 16:21:47,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 16:21:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-16 16:21:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 16:21:47,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:21:47,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:21:47,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:47,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 16:21:47,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:21:48,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:21:48,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:21:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:21:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2022-11-16 16:21:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:21:48,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812356948] [2022-11-16 16:21:48,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:21:48,126 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-16 16:21:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:21:48,127 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:21:48,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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 (22)] Waiting until timeout for monitored process [2022-11-16 16:21:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:21:48,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 16:21:48,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:48,566 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-16 16:21:49,223 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 19 treesize of output 11 [2022-11-16 16:21:49,235 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 7 treesize of output 5 [2022-11-16 16:21:49,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:21:49,724 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 25 treesize of output 25 [2022-11-16 16:21:49,787 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-16 16:21:49,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 17 [2022-11-16 16:21:50,475 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-16 16:21:50,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 37 [2022-11-16 16:21:50,577 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 16:21:50,577 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 1 case distinctions, treesize of input 28 treesize of output 38 [2022-11-16 16:21:50,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-11-16 16:21:51,057 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 16:21:51,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 88 [2022-11-16 16:21:51,139 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:21:51,139 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 77 [2022-11-16 16:21:51,597 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 49 [2022-11-16 16:21:51,851 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-16 16:21:51,851 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 21 [2022-11-16 16:21:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:21:52,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:21:52,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1268 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1267))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) (_ bv0 32)))) is different from false [2022-11-16 16:21:52,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1268 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1267))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1264) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-16 16:21:53,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:21:53,547 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 304 treesize of output 280 [2022-11-16 16:21:53,559 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 268 treesize of output 266 [2022-11-16 16:21:53,570 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 266 treesize of output 262 [2022-11-16 16:21:53,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse5))) (let ((.cse1 (not .cse7)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse10 (not .cse3))) (let ((.cse0 (let ((.cse12 (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (bvadd v_arrayElimCell_134 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1267))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_136 (_ bv4 32))) (_ bv0 32)))) .cse10))) (and (or (and .cse12 (or .cse3 (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (not (= (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (bvadd v_arrayElimCell_134 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1267))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_133 (_ bv4 32))) (_ bv0 32)))))) .cse7) (or .cse1 (and (or .cse3 (forall ((v_arrayElimCell_135 (_ BitVec 32)) (v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse14 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (bvadd v_arrayElimCell_134 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1267))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_135 (_ bv4 32))) (_ bv0 32))))) .cse12))))) (.cse2 (or .cse10 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (not (= (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (bvadd v_arrayElimCell_133 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1267))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_136 (_ bv4 32))) (_ bv0 32))))))) (and (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or .cse1 (and .cse2 (or .cse3 (forall ((v_arrayElimCell_135 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (not (= (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (bvadd v_arrayElimCell_133 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1267))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_135 (_ bv4 32))) (_ bv0 32))))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.offset|) .cse0) (or .cse7 (and .cse2 (or .cse3 (forall ((v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (not (= (_ bv0 32) (let ((.cse9 (bvadd v_arrayElimCell_133 (_ bv4 32)))) (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1267))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse9))))))))))))) is different from false [2022-11-16 16:21:58,090 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 1)))) (.cse9 (not (bvult |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|))) (.cse10 (= |c_ULTIMATE.start_main_~#s~0#1.base| (_ bv0 32)))) (let ((.cse0 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|) (forall ((v_arrayElimCell_135 (_ BitVec 32)) (v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1271))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (let ((.cse15 (store (store .cse16 .cse17 (store (select .cse16 .cse17) (bvadd v_arrayElimCell_134 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1267))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_135 (_ bv4 32))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse17)))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|))))) (or (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1271))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse18 .cse19 (store (select .cse18 .cse19) (bvadd v_arrayElimCell_134 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1267) (select v_ArrVal_1267 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_136 (_ bv4 32))) (_ bv0 32))) (= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse8 .cse9 .cse10) (or .cse8 .cse9 (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1271))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse20 .cse21 (store (select .cse20 .cse21) (bvadd v_arrayElimCell_134 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1267) (select v_ArrVal_1267 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_136 (_ bv4 32))) (_ bv0 32))) (not (= .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) .cse10) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ bv0 32)) (forall ((v_arrayElimCell_134 (_ BitVec 32)) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1271))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (let ((.cse22 (store (store .cse23 .cse24 (store (select .cse23 .cse24) (bvadd v_arrayElimCell_134 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1267))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_133 (_ bv4 32))) (_ bv0 32))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse24))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|)))))))) (and (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.offset|) .cse0) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ BitVec 32))) (or (forall ((v_arrayElimCell_135 (_ BitVec 32)) (v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1271))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1)) (not (= (select (let ((.cse2 (store (store .cse3 .cse1 (store (select .cse3 .cse1) (bvadd v_arrayElimCell_133 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1267))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_135 (_ bv4 32))) (_ bv0 32))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| (_ bv0 32)) (forall ((v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1271))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse4) (not (= (let ((.cse7 (bvadd v_arrayElimCell_133 (_ bv4 32)))) (select (let ((.cse5 (store (store .cse6 .cse4 (store (select .cse6 .cse4) .cse7 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54| v_ArrVal_1267))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse7)) (_ bv0 32))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_54|))))) (or .cse8 .cse9 .cse10 (forall ((v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1271))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (select (store (store .cse11 .cse12 (store (select .cse11 .cse12) (bvadd v_arrayElimCell_133 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1267) (select v_ArrVal_1267 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_136 (_ bv4 32))))) (not (= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (or .cse8 .cse9 .cse10 (forall ((v_ArrVal_1271 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_1267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_133 (_ BitVec 32))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1271))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) (select (select (store (store .cse14 .cse13 (store (select .cse14 .cse13) (bvadd v_arrayElimCell_133 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1267) (select v_ArrVal_1267 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_136 (_ bv4 32)))))))))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0)))) is different from true [2022-11-16 16:21:58,095 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:21:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812356948] [2022-11-16 16:21:58,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812356948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:21:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2036723268] [2022-11-16 16:21:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:21:58,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:21:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:21:58,097 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:21:58,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-16 16:21:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:21:58,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 16:21:58,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:21:59,018 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-16 16:22:01,106 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 19 treesize of output 11 [2022-11-16 16:22:01,116 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 7 treesize of output 5 [2022-11-16 16:22:01,132 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 7 treesize of output 3 [2022-11-16 16:22:02,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:02,189 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 25 treesize of output 25 [2022-11-16 16:22:02,266 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-16 16:22:02,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 17 [2022-11-16 16:22:02,373 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:22:02,373 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 16:22:02,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:22:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:04,000 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-16 16:22:04,097 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 16:22:04,097 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 1 case distinctions, treesize of input 35 treesize of output 43 [2022-11-16 16:22:04,134 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 21 treesize of output 17 [2022-11-16 16:22:04,784 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 16:22:04,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 88 [2022-11-16 16:22:04,846 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 16:22:04,847 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 82 [2022-11-16 16:22:05,484 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 72 treesize of output 52 [2022-11-16 16:22:06,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:22:06,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 21 [2022-11-16 16:22:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:22:06,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:22:06,405 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1341))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-16 16:22:06,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1341))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1339) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-16 16:22:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2036723268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:22:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428676325] [2022-11-16 16:22:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:22:09,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:22:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:22:09,723 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:22:09,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 16:22:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:22:09,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 16:22:09,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:22:10,091 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-16 16:22:12,360 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 11 treesize of output 7 [2022-11-16 16:22:12,372 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 7 treesize of output 3 [2022-11-16 16:22:13,240 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:22:13,240 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 16:22:13,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:22:13,343 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:22:13,344 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-16 16:22:13,385 INFO L321 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-11-16 16:22:13,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 15 [2022-11-16 16:22:13,403 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 6 treesize of output 4 [2022-11-16 16:22:15,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:15,234 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-11-16 16:22:15,290 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 16:22:15,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2022-11-16 16:22:15,912 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 16:22:15,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 53 [2022-11-16 16:22:16,010 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 16:22:16,010 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 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-16 16:22:16,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:22:16,662 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 15 treesize of output 7 [2022-11-16 16:22:17,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:22:17,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2022-11-16 16:22:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:22:17,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:22:17,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1417))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1418) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) (_ bv0 32)))) is different from false [2022-11-16 16:22:27,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428676325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:22:27,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:22:27,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 50 [2022-11-16 16:22:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941810282] [2022-11-16 16:22:27,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:22:27,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 16:22:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-16 16:22:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 16:22:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3379, Unknown=179, NotChecked=882, Total=4692 [2022-11-16 16:22:27,115 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 50 states, 47 states have (on average 1.574468085106383) internal successors, (74), 41 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 16:22:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:22:29,737 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-11-16 16:22:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 16:22:29,739 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.574468085106383) internal successors, (74), 41 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 40 [2022-11-16 16:22:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:22:29,740 INFO L225 Difference]: With dead ends: 45 [2022-11-16 16:22:29,740 INFO L226 Difference]: Without dead ends: 42 [2022-11-16 16:22:29,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=299, Invalid=3838, Unknown=181, NotChecked=938, Total=5256 [2022-11-16 16:22:29,742 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:22:29,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 327 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 172 Unchecked, 1.1s Time] [2022-11-16 16:22:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-16 16:22:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-11-16 16:22:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 16:22:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-11-16 16:22:29,755 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 40 [2022-11-16 16:22:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:22:29,756 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-11-16 16:22:29,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.574468085106383) internal successors, (74), 41 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 16:22:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-11-16 16:22:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 16:22:29,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:22:29,758 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:22:29,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-16 16:22:29,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 16:22:30,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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 (22)] Forceful destruction successful, exit code 0 [2022-11-16 16:22:30,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:22:30,362 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:22:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:22:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 382131188, now seen corresponding path program 1 times [2022-11-16 16:22:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-16 16:22:30,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048471756] [2022-11-16 16:22:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:22:30,364 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-16 16:22:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/mathsat [2022-11-16 16:22:30,364 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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-16 16:22:30,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/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)] Waiting until timeout for monitored process [2022-11-16 16:22:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:22:30,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-16 16:22:30,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:22:30,914 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-16 16:22:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-16 16:22:31,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-16 16:22:31,882 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 19 treesize of output 11 [2022-11-16 16:22:31,891 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 7 treesize of output 5 [2022-11-16 16:22:31,907 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 7 treesize of output 3 [2022-11-16 16:22:32,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-16 16:22:32,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:32,567 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 25 treesize of output 25 [2022-11-16 16:22:32,637 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-16 16:22:32,637 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 17 treesize of output 17 [2022-11-16 16:22:32,716 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:22:32,716 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 16:22:32,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:22:33,755 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-16 16:22:33,755 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2022-11-16 16:22:33,813 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 16:22:33,813 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2022-11-16 16:22:33,846 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 18 treesize of output 20 [2022-11-16 16:22:34,247 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 16:22:34,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 93 [2022-11-16 16:22:34,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:34,297 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 53 treesize of output 44 [2022-11-16 16:22:34,372 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-16 16:22:34,372 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 2 case distinctions, treesize of input 33 treesize of output 50 [2022-11-16 16:22:34,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:22:35,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:22:35,286 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-16 16:22:35,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 47 [2022-11-16 16:22:35,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:35,340 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 16:22:35,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-16 16:22:35,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-16 16:22:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:22:36,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:22:36,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1502 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1501)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1500))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1502)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-11-16 16:22:36,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1502 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1501)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1500))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1498))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1502))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-16 16:22:37,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1502 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1501)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1500))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1498))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1502))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-16 16:22:37,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1502 (_ BitVec 32)) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1501)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1500))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1498))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) v_ArrVal_1502))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-11-16 16:22:38,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:22:38,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 319 treesize of output 312 [2022-11-16 16:22:38,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:22:38,379 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 4980 treesize of output 4708 [2022-11-16 16:22:38,517 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 5672 treesize of output 4720 [2022-11-16 16:22:38,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:22:38,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 1849 treesize of output 1717 [2022-11-16 16:22:39,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:22:39,583 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 4583 treesize of output 4179 [2022-11-16 16:22:51,741 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_insert_~data#1|))) (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= (_ bv0 32) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509))) (let ((.cse3 (bvadd (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (let ((.cse0 (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501))) (select (select .cse0 (select (select (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= .cse2 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse8 (bvadd (select (select .cse9 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (select (let ((.cse5 (store (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)))) (or (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32)) (v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)))) .cse10) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509)) (.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse17 (bvadd (select (select .cse18 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (let ((.cse11 (store (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501)) (.cse14 (store (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (not (= (_ bv4 32) (select (select .cse11 .cse12) .cse13))) (not (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (select (select .cse14 .cse12) .cse13))))))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (let ((.cse23 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509))) (let ((.cse22 (bvadd (select (select .cse23 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (select (let ((.cse19 (store (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (= .cse21 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)))))))) (or .cse10 (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32)) (v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)) (not (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (let ((.cse28 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509)) (.cse25 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse27 (bvadd (select (select .cse28 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (select (let ((.cse24 (store (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store .cse28 .cse26 (store (select .cse28 .cse26) .cse27 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509)) (.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse35 (bvadd (select (select .cse36 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (let ((.cse29 (store (store .cse36 .cse34 (store (select .cse36 .cse34) .cse35 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501)) (.cse32 (store (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (bvadd (_ bv4 32) (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (_ bv0 32) (select (select .cse29 .cse30) .cse31)) (not (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (select (select .cse32 .cse30) .cse31))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|))) (forall ((v_ArrVal_1510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1510))) (let ((.cse37 (select (select .cse39 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_1509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= .cse37 (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1509))) (let ((.cse40 (bvadd (select (select .cse41 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (select (let ((.cse38 (store (store .cse39 .cse37 (store (select .cse39 .cse37) .cse40 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1500))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store .cse41 .cse37 (store (select .cse41 .cse37) .cse40 (_ bv0 32))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_1501) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (= .cse37 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)))))) is different from true [2022-11-16 16:22:51,744 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-16 16:22:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048471756] [2022-11-16 16:22:51,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048471756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:22:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [13899742] [2022-11-16 16:22:51,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:22:51,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 16:22:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 [2022-11-16 16:22:51,746 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 16:22:51,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-16 16:22:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:22:52,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 16:22:52,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:22:55,368 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 7 treesize of output 3 [2022-11-16 16:22:55,386 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 7 treesize of output 3 [2022-11-16 16:22:56,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-16 16:22:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:56,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:56,765 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 22 treesize of output 25 [2022-11-16 16:22:56,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:56,949 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 16:22:56,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 1 case distinctions, treesize of input 22 treesize of output 29 [2022-11-16 16:22:58,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:58,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:22:58,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:22:59,182 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-16 16:22:59,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 88 [2022-11-16 16:22:59,343 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 16:22:59,344 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 18 treesize of output 28 [2022-11-16 16:22:59,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:22:59,618 INFO L321 Elim1Store]: treesize reduction 84, result has 24.3 percent of original size [2022-11-16 16:22:59,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 65 [2022-11-16 16:23:00,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:23:00,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:23:00,694 INFO L321 Elim1Store]: treesize reduction 85, result has 28.0 percent of original size [2022-11-16 16:23:00,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 366 treesize of output 167 [2022-11-16 16:23:00,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:23:00,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:23:00,817 INFO L321 Elim1Store]: treesize reduction 76, result has 12.6 percent of original size [2022-11-16 16:23:00,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 97 [2022-11-16 16:23:00,846 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 27 treesize of output 26 [2022-11-16 16:23:03,425 INFO L321 Elim1Store]: treesize reduction 48, result has 59.0 percent of original size [2022-11-16 16:23:03,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 180 treesize of output 170 [2022-11-16 16:23:04,235 INFO L321 Elim1Store]: treesize reduction 40, result has 68.0 percent of original size [2022-11-16 16:23:04,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 194 [2022-11-16 16:23:32,613 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 16:23:32,613 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 43 treesize of output 38 [2022-11-16 16:23:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:23:32,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:23:46,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:23:46,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 1349 treesize of output 1342 [2022-11-16 16:23:47,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:23:47,234 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 14330 treesize of output 13687 [2022-11-16 16:23:47,462 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 15616 treesize of output 13044 [2022-11-16 16:23:52,387 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 646 treesize of output 3 [2022-11-16 16:23:52,570 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 646 treesize of output 3 [2022-11-16 16:23:53,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:23:53,218 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 5191 treesize of output 4552 [2022-11-16 16:23:58,379 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_1602 (_ BitVec 32)) (v_ArrVal_1603 (_ BitVec 32))) (= (let ((.cse58 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1602))) (.cse62 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1603)))) (let ((.cse57 (bvadd (_ bv4 32) (select (select .cse62 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse59 (select (select .cse58 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse54 (let ((.cse61 (select .cse62 .cse59))) (let ((.cse60 (store .cse62 .cse59 (store .cse61 .cse57 (_ bv0 32))))) (store .cse60 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse60 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse61 .cse57))))))) (select (select .cse54 (select (select (let ((.cse56 (select .cse58 .cse59))) (let ((.cse55 (store .cse58 .cse59 (store .cse56 .cse57 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|)))) (store .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse56 .cse57))))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select .cse54 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (_ bv0 32))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_insert_~data#1|) (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_1602 (_ BitVec 32)) (v_ArrVal_1603 (_ BitVec 32))) (= (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1602))) (.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1603)))) (let ((.cse3 (bvadd (_ bv4 32) (select (select .cse8 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (let ((.cse2 (select .cse4 .cse5))) (let ((.cse1 (store .cse4 .cse5 (store .cse2 .cse3 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|)))) (store .cse1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse2 .cse3))))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (let ((.cse7 (select .cse8 .cse5))) (let ((.cse6 (store .cse8 .cse5 (store .cse7 .cse3 (_ bv0 32))))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse7 .cse3))))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))) .cse9)) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (_ BitVec 32))) (or (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1602 (_ BitVec 32)) (v_ArrVal_1603 (_ BitVec 32))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1602))) (.cse21 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1603)))) (let ((.cse16 (bvadd (_ bv4 32) (select (select .cse21 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse18 (select (select .cse17 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse10 (let ((.cse20 (select .cse21 .cse18))) (let ((.cse19 (store .cse21 .cse18 (store .cse20 .cse16 (_ bv0 32))))) (store .cse19 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse19 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse20 .cse16)))))) (.cse13 (let ((.cse15 (select .cse17 .cse18))) (let ((.cse14 (store .cse17 .cse18 (store .cse15 .cse16 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|)))) (store .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse14 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse15 .cse16))))))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select (select .cse10 .cse11) .cse12) (_ bv0 32)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (select (select .cse13 .cse11) .cse12)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_1602 (_ BitVec 32)) (v_ArrVal_1603 (_ BitVec 32))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1602)))) (let ((.cse23 (select (select .cse28 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse22 (let ((.cse31 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1603)))) (let ((.cse27 (bvadd (_ bv4 32) (select (select .cse31 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (select (let ((.cse24 (let ((.cse26 (select .cse28 .cse23))) (let ((.cse25 (store .cse28 .cse23 (store .cse26 .cse27 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|)))) (store .cse25 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse25 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse26 .cse27))))))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (let ((.cse30 (select .cse31 .cse23))) (let ((.cse29 (store .cse31 .cse23 (store .cse30 .cse27 (_ bv0 32))))) (store .cse29 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse29 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse30 .cse27))))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse22 (_ bv0 32)) (not (= .cse22 .cse23))))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_1602 (_ BitVec 32)) (v_ArrVal_1603 (_ BitVec 32))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1602))) (.cse43 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1603)))) (let ((.cse39 (bvadd (_ bv4 32) (select (select .cse43 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse36 (select (select .cse40 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse32 (let ((.cse42 (select .cse43 .cse36))) (let ((.cse41 (store .cse43 .cse36 (store .cse42 .cse39 (_ bv0 32))))) (store .cse41 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse41 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse42 .cse39)))))) (.cse35 (let ((.cse38 (select .cse40 .cse36))) (let ((.cse37 (store .cse40 .cse36 (store .cse38 .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|)))) (store .cse37 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse37 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse38 .cse39))))))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse34 (bvadd (_ bv4 32) (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select (select .cse32 .cse33) .cse34) (_ bv0 32)) (not (= (select (select .cse35 .cse33) .cse34) .cse36)))))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))) .cse9 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (_ BitVec 32))) (or (forall ((v_ArrVal_1602 (_ BitVec 32)) (v_ArrVal_1603 (_ BitVec 32))) (let ((.cse44 (let ((.cse49 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1602))) (.cse53 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_1603)))) (let ((.cse48 (bvadd (_ bv4 32) (select (select .cse53 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse50 (select (select .cse49 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse45 (let ((.cse47 (select .cse49 .cse50))) (let ((.cse46 (store .cse49 .cse50 (store .cse47 .cse48 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|)))) (store .cse46 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse46 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse47 .cse48))))))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (let ((.cse52 (select .cse53 .cse50))) (let ((.cse51 (store .cse53 .cse50 (store .cse52 .cse48 (_ bv0 32))))) (store .cse51 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| (store (select .cse51 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66|) (_ bv4 32) (select .cse52 .cse48))))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (= .cse44 (_ bv0 32)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| .cse44)))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_66| |c_#StackHeapBarrier|)))))) is different from true [2022-11-16 16:23:58,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [13899742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:23:58,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393279899] [2022-11-16 16:23:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:23:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:23:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:23:58,383 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:23:58,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df1969d8-a60a-4c19-8e7d-fe03204e4c66/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 16:23:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:23:58,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 16:23:58,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:23:58,665 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-16 16:23:59,249 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 7 treesize of output 5 [2022-11-16 16:23:59,810 WARN L855 $PredicateComparison]: unable to prove that (and (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1))))) is different from true [2022-11-16 16:23:59,954 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 16:23:59,954 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 14 treesize of output 20 [2022-11-16 16:24:00,633 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 7 treesize of output 5 [2022-11-16 16:24:02,285 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 16:24:02,285 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 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 16:24:05,269 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 20 treesize of output 12 [2022-11-16 16:24:05,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-16 16:24:05,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 16:24:06,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-11-16 16:24:06,579 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 16:24:06,579 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 14 treesize of output 20 [2022-11-16 16:24:06,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:24:06,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:24:06,626 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 26 treesize of output 26 [2022-11-16 16:24:06,735 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 16:24:06,735 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 24 treesize of output 26 [2022-11-16 16:24:10,077 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-16 16:24:10,078 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2022-11-16 16:24:10,094 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-16 16:24:10,146 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 18 treesize of output 20 [2022-11-16 16:24:11,287 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 16:24:11,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 94 [2022-11-16 16:24:11,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:24:11,355 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 53 treesize of output 44 [2022-11-16 16:24:11,465 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 16:24:11,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2022-11-16 16:24:11,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 16:24:13,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:24:13,516 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-16 16:24:13,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 48 [2022-11-16 16:24:13,576 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 16:24:13,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-16 16:24:14,940 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 15 treesize of output 7 [2022-11-16 16:24:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-11-16 16:24:14,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:24:15,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1681 (_ BitVec 32)) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1680)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1679))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1681)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-11-16 16:24:15,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1681 (_ BitVec 32)) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1680)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1679))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1675))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1681))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-16 16:24:15,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1681 (_ BitVec 32)) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1680)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1679))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1675))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1681))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-16 16:24:15,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1681 (_ BitVec 32)) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1680)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1679))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1675))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) v_ArrVal_1681))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-11-16 16:24:16,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:24:16,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 319 treesize of output 312 [2022-11-16 16:24:16,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:24:16,904 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 4984 treesize of output 4708 [2022-11-16 16:24:17,012 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 5116 treesize of output 4436 [2022-11-16 16:24:20,268 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 993 treesize of output 857 [2022-11-16 16:26:24,222 WARN L233 SmtUtils]: Spent 2.06m on a formula simplification that was a NOOP. DAG size: 159 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 16:26:24,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:26:24,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2532 treesize of output 4074