./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:51:30,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:51:30,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:51:30,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:51:30,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:51:30,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:51:30,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:51:30,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:51:30,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:51:30,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:51:30,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:51:30,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:51:30,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:51:30,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:51:30,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:51:30,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:51:30,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:51:30,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:51:30,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:51:30,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:51:30,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:51:30,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:51:30,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:51:30,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:51:30,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:51:30,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:51:30,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:51:30,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:51:30,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:51:30,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:51:30,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:51:30,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:51:30,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:51:30,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:51:30,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:51:30,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:51:30,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:51:30,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:51:30,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:51:30,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:51:30,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:51:30,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 05:51:30,671 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:51:30,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:51:30,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:51:30,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:51:30,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:51:30,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:51:30,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:51:30,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:51:30,678 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:51:30,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:51:30,679 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:51:30,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:51:30,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:51:30,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:51:30,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:51:30,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:51:30,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:51:30,681 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:51:30,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:51:30,681 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:51:30,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:51:30,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:51:30,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:51:30,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:51:30,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:51:30,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:51:30,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:51:30,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:51:30,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:51:30,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:51:30,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:51:30,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:51:30,684 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:51:30,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:51:30,685 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:51:30,685 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2023-02-17 05:51:30,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:51:30,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:51:30,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:51:30,980 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:51:30,981 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:51:30,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2023-02-17 05:51:32,133 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:51:32,363 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:51:32,363 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2023-02-17 05:51:32,381 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82216cd18/47ad0ab0008f4c82b700d096fbe01b7a/FLAGbc34eca74 [2023-02-17 05:51:32,399 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82216cd18/47ad0ab0008f4c82b700d096fbe01b7a [2023-02-17 05:51:32,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:51:32,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:51:32,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:51:32,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:51:32,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:51:32,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db8c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32, skipping insertion in model container [2023-02-17 05:51:32,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:51:32,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:51:32,714 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2023-02-17 05:51:32,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:51:32,795 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:51:32,816 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i[22634,22647] [2023-02-17 05:51:32,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:51:32,858 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:51:32,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32 WrapperNode [2023-02-17 05:51:32,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:51:32,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:51:32,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:51:32,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:51:32,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,922 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 228 [2023-02-17 05:51:32,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:51:32,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:51:32,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:51:32,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:51:32,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:51:32,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:51:32,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:51:32,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:51:32,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (1/1) ... [2023-02-17 05:51:32,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:51:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:51:33,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 05:51:33,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 05:51:33,047 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-17 05:51:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-17 05:51:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-02-17 05:51:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-02-17 05:51:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 05:51:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:51:33,048 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-02-17 05:51:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-02-17 05:51:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 05:51:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 05:51:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-02-17 05:51:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-02-17 05:51:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 05:51:33,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 05:51:33,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 05:51:33,050 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-02-17 05:51:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-02-17 05:51:33,050 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-02-17 05:51:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-02-17 05:51:33,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:51:33,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:51:33,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:51:33,190 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:51:33,192 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:51:33,640 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:51:33,648 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:51:33,649 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2023-02-17 05:51:33,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:51:33 BoogieIcfgContainer [2023-02-17 05:51:33,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:51:33,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:51:33,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:51:33,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:51:33,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:51:32" (1/3) ... [2023-02-17 05:51:33,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d32e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:51:33, skipping insertion in model container [2023-02-17 05:51:33,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:51:32" (2/3) ... [2023-02-17 05:51:33,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d32e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:51:33, skipping insertion in model container [2023-02-17 05:51:33,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:51:33" (3/3) ... [2023-02-17 05:51:33,659 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2023-02-17 05:51:33,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:51:33,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:51:33,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:51:33,742 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=PETRI_NET, 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;@432a714e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:51:33,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:51:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-17 05:51:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 05:51:33,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:51:33,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:51:33,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:51:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:51:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash 760908611, now seen corresponding path program 1 times [2023-02-17 05:51:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:51:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014658622] [2023-02-17 05:51:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:51:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:33,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:34,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:51:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 05:51:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:51:34,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014658622] [2023-02-17 05:51:34,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014658622] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:51:34,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:51:34,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:51:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644960194] [2023-02-17 05:51:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:51:34,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:51:34,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:51:34,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:51:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:51:34,208 INFO L87 Difference]: Start difference. First operand has 128 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 116 states have internal predecessors, (164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 05:51:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:51:34,471 INFO L93 Difference]: Finished difference Result 251 states and 429 transitions. [2023-02-17 05:51:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:51:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-02-17 05:51:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:51:34,484 INFO L225 Difference]: With dead ends: 251 [2023-02-17 05:51:34,484 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 05:51:34,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:51:34,499 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:51:34,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:51:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 05:51:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-17 05:51:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 108 states have internal predecessors, (115), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 05:51:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-17 05:51:34,573 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 37 [2023-02-17 05:51:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:51:34,574 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-17 05:51:34,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 05:51:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-17 05:51:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 05:51:34,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:51:34,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:51:34,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:51:34,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:51:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:51:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1675514385, now seen corresponding path program 1 times [2023-02-17 05:51:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:51:34,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633102958] [2023-02-17 05:51:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:51:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:35,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:51:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:51:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:51:35,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633102958] [2023-02-17 05:51:35,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633102958] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:51:35,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332810589] [2023-02-17 05:51:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:35,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:51:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:51:35,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:51:35,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 05:51:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:35,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 05:51:35,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:51:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:51:35,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:51:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:51:35,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332810589] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:51:35,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:51:35,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 12 [2023-02-17 05:51:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521660155] [2023-02-17 05:51:35,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:51:35,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 05:51:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:51:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 05:51:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-17 05:51:35,795 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 05:51:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:51:36,261 INFO L93 Difference]: Finished difference Result 250 states and 324 transitions. [2023-02-17 05:51:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 05:51:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2023-02-17 05:51:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:51:36,263 INFO L225 Difference]: With dead ends: 250 [2023-02-17 05:51:36,264 INFO L226 Difference]: Without dead ends: 133 [2023-02-17 05:51:36,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-17 05:51:36,266 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:51:36,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1037 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 05:51:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-17 05:51:36,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-17 05:51:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 116 states have internal predecessors, (124), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 05:51:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2023-02-17 05:51:36,287 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 38 [2023-02-17 05:51:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:51:36,288 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2023-02-17 05:51:36,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 05:51:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2023-02-17 05:51:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-17 05:51:36,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:51:36,297 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:51:36,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 05:51:36,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:51:36,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:51:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:51:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 800158065, now seen corresponding path program 1 times [2023-02-17 05:51:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:51:36,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122120002] [2023-02-17 05:51:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:51:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 05:51:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 05:51:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:51:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 05:51:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 05:51:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 05:51:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:51:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-17 05:51:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:51:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122120002] [2023-02-17 05:51:39,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122120002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:51:39,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751908972] [2023-02-17 05:51:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:51:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:51:39,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:51:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 05:51:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:39,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 05:51:39,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:51:39,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 05:51:39,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 100 [2023-02-17 05:51:39,991 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 22 treesize of output 20 [2023-02-17 05:51:40,000 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 38 treesize of output 32 [2023-02-17 05:51:40,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:40,018 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 27 [2023-02-17 05:51:40,022 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:40,058 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_dll_insert_master_#in~dll#1.base|))) (let ((.cse4 (select .cse3 |c_dll_insert_master_#in~dll#1.offset|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse0 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse1)) (.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (and (= v_DerPreprocessor_2 .cse0) (not (= 0 .cse1)) (= .cse2 .cse3) (not (= .cse1 |c_dll_insert_master_#in~dll#1.base|)) (not (= |c_dll_insert_master_#in~dll#1.base| .cse1)) (= .cse4 .cse1) (= .cse0 .cse2))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse5 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse6))) (and (= v_DerPreprocessor_2 .cse5) (not (= 0 .cse6)) (not (= .cse6 |c_dll_insert_master_#in~dll#1.base|)) (not (= |c_dll_insert_master_#in~dll#1.base| .cse6)) (= .cse4 .cse6) (= .cse5 v_DerPreprocessor_3) (= .cse5 (select |c_#memory_$Pointer$.base| .cse6)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse8 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse7))) (and (= .cse7 |c_dll_insert_master_#in~dll#1.base|) (= v_DerPreprocessor_2 .cse8) (not (= 0 .cse7)) (= (select |c_#memory_$Pointer$.base| .cse7) .cse3) (not (= |c_dll_insert_master_#in~dll#1.base| .cse7)) (= .cse4 .cse7) (= .cse8 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse10))) (and (= v_DerPreprocessor_2 .cse9) (not (= 0 .cse10)) (not (= .cse10 |c_dll_insert_master_#in~dll#1.base|)) (not (= |c_dll_insert_master_#in~dll#1.base| .cse10)) (= .cse4 .cse10) (= .cse9 (select |c_#memory_$Pointer$.base| .cse10)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_3 |c_dll_insert_master_#in~dll#1.offset|))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse12 v_DerPreprocessor_2) |c_dll_insert_master_#in~dll#1.base| v_DerPreprocessor_3) .cse12)) (.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (and (= v_DerPreprocessor_2 .cse11) (not (= 0 .cse12)) (= .cse13 .cse3) (not (= |c_dll_insert_master_#in~dll#1.base| .cse12)) (= .cse4 .cse12) (= .cse11 v_DerPreprocessor_3) (= .cse11 .cse13))))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse4))) (and (= (select .cse14 |c_dll_insert_master_#in~dll#1.offset|) .cse4) (= |c_dll_insert_master_#in~dll#1.base| .cse4) (or (not (= .cse4 |c_dll_insert_master_#in~dll#1.base|)) (= .cse14 .cse3)) (not (= 0 .cse4))))))) is different from true [2023-02-17 05:51:40,119 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (let ((.cse0 (select .cse2 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (or (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0))) (and (or (not (= .cse0 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse1 .cse2)) (= (select .cse1 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) .cse0) (not (= 0 .cse0)) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse0))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse4 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse3))) (and (not (= 0 .cse3)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse3)) (not (= .cse3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse4 (select |c_#memory_$Pointer$.base| .cse3)) (= .cse0 .cse3) (= v_DerPreprocessor_2 .cse4))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6)) (.cse7 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse6))) (and (= .cse5 .cse2) (not (= 0 .cse6)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse6)) (= .cse7 .cse5) (= .cse0 .cse6) (= v_DerPreprocessor_2 .cse7) (= .cse7 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse8))) (and (not (= 0 .cse8)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse8)) (not (= .cse8 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse9 (select |c_#memory_$Pointer$.base| .cse8)) (= .cse0 .cse8) (= v_DerPreprocessor_2 .cse9) (= .cse9 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse10))) (and (= (select |c_#memory_$Pointer$.base| .cse10) .cse2) (not (= 0 .cse10)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse10)) (= .cse0 .cse10) (= v_DerPreprocessor_2 .cse11) (= .cse10 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) (= .cse11 v_DerPreprocessor_3))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse13)) (.cse14 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse13))) (and (= .cse12 .cse2) (not (= 0 .cse13)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse13)) (not (= .cse13 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (= .cse14 .cse12) (= .cse0 .cse13) (= v_DerPreprocessor_2 .cse14)))))))) is different from true [2023-02-17 05:51:40,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 05:51:40,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 460 treesize of output 609 [2023-02-17 05:51:40,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 415 treesize of output 395 [2023-02-17 05:51:40,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 59 treesize of output 49 [2023-02-17 05:51:40,774 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 59 treesize of output 49 [2023-02-17 05:51:40,808 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:40,839 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:40,847 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 59 treesize of output 49 [2023-02-17 05:51:40,868 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:40,877 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:40,883 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 496 treesize of output 480 [2023-02-17 05:51:41,075 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 11 [2023-02-17 05:51:41,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,085 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 46 treesize of output 34 [2023-02-17 05:51:41,089 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 35 treesize of output 27 [2023-02-17 05:51:41,093 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 35 treesize of output 27 [2023-02-17 05:51:41,098 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,102 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,108 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 35 treesize of output 27 [2023-02-17 05:51:41,114 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,119 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,123 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,127 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,133 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,143 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 46 treesize of output 34 [2023-02-17 05:51:41,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,153 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,158 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,162 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,166 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,171 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 34 treesize of output 24 [2023-02-17 05:51:41,187 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,192 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,209 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,213 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,221 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 46 treesize of output 34 [2023-02-17 05:51:41,225 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,240 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,245 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,248 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,252 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,256 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,261 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,267 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 46 treesize of output 34 [2023-02-17 05:51:41,272 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,277 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,281 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,286 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,292 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,296 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,309 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,313 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,320 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,330 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,334 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,339 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,344 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 48 treesize of output 36 [2023-02-17 05:51:41,349 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,353 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,357 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,363 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,367 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,372 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 48 treesize of output 36 [2023-02-17 05:51:41,377 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,391 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,398 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 05:51:41,402 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 346 treesize of output 330 [2023-02-17 05:51:41,419 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 14 treesize of output 10 [2023-02-17 05:51:41,421 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 12 treesize of output 8 [2023-02-17 05:51:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-02-17 05:51:41,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:51:41,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 05:51:41,502 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 104 treesize of output 107 [2023-02-17 05:51:41,504 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 120 treesize of output 116 [2023-02-17 05:51:41,507 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 116 treesize of output 114 [2023-02-17 05:51:41,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:41,516 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,518 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 [2023-02-17 05:51:41,522 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 [2023-02-17 05:51:41,525 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:41,527 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,533 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,534 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:41,536 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 05:51:41,554 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 104 treesize of output 107 [2023-02-17 05:51:41,557 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 120 treesize of output 116 [2023-02-17 05:51:41,561 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 116 treesize of output 114 [2023-02-17 05:51:41,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:41,567 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,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 20 treesize of output 18 [2023-02-17 05:51:41,573 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 [2023-02-17 05:51:41,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:41,576 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 05:51:41,579 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,582 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 05:51:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-02-17 05:51:41,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751908972] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:51:41,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:51:41,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 29 [2023-02-17 05:51:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439276733] [2023-02-17 05:51:41,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:51:41,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 05:51:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:51:41,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 05:51:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=645, Unknown=3, NotChecked=102, Total=812 [2023-02-17 05:51:41,634 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-17 05:51:42,460 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_dll_create_generic_~#dll~0.base|))) (let ((.cse0 (select .cse4 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse12 (not (= 0 .cse0)))) (and (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse1))) (and (= .cse0 .cse1) (not (= 0 .cse1)) (= .cse2 (select |c_#memory_$Pointer$.base| .cse1)) (not (= .cse1 |c_dll_create_generic_~#dll~0.base|)) (= v_DerPreprocessor_2 .cse2) (not (= |c_dll_create_generic_~#dll~0.base| .cse1)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse5 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse3))) (and (= .cse0 .cse3) (= .cse3 |c_dll_create_generic_~#dll~0.base|) (not (= 0 .cse3)) (= (select |c_#memory_$Pointer$.base| .cse3) .cse4) (= v_DerPreprocessor_2 .cse5) (= .cse5 v_DerPreprocessor_3) (not (= |c_dll_create_generic_~#dll~0.base| .cse3)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse7 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse6))) (and (= .cse0 .cse6) (not (= 0 .cse6)) (= .cse7 (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 |c_dll_create_generic_~#dll~0.base|)) (= v_DerPreprocessor_2 .cse7) (= .cse7 v_DerPreprocessor_3) (not (= |c_dll_create_generic_~#dll~0.base| .cse6)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8)) (.cse10 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse8 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse8))) (and (= .cse0 .cse8) (not (= 0 .cse8)) (= .cse9 .cse4) (= .cse10 .cse9) (not (= .cse8 |c_dll_create_generic_~#dll~0.base|)) (= v_DerPreprocessor_2 .cse10) (not (= |c_dll_create_generic_~#dll~0.base| .cse8)))))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse0))) (and (or (= .cse11 .cse4) (not (= .cse0 |c_dll_create_generic_~#dll~0.base|))) (= (select .cse11 |c_dll_create_generic_~#dll~0.offset|) .cse0) .cse12 (= |c_dll_create_generic_~#dll~0.base| .cse0))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_3 |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13)) (.cse15 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |c_dll_create_generic_~#dll~0.base| v_DerPreprocessor_3) .cse13))) (and (= .cse0 .cse13) (not (= 0 .cse13)) (= .cse14 .cse4) (= .cse15 .cse14) (= v_DerPreprocessor_2 .cse15) (= .cse15 v_DerPreprocessor_3) (not (= |c_dll_create_generic_~#dll~0.base| .cse13))))))) (= 0 |c_dll_create_generic_~#dll~0.offset|) .cse12 (<= |c_#StackHeapBarrier| (+ |c_dll_create_generic_~#dll~0.base| (- 1))))))) is different from true [2023-02-17 05:51:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:51:43,149 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2023-02-17 05:51:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 05:51:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) Word has length 110 [2023-02-17 05:51:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:51:43,151 INFO L225 Difference]: With dead ends: 334 [2023-02-17 05:51:43,151 INFO L226 Difference]: Without dead ends: 205 [2023-02-17 05:51:43,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 234 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1982, Unknown=8, NotChecked=276, Total=2450 [2023-02-17 05:51:43,155 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 273 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 59 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 483 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:51:43,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1761 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1818 Invalid, 9 Unknown, 483 Unchecked, 1.1s Time] [2023-02-17 05:51:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-17 05:51:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 165. [2023-02-17 05:51:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.253968253968254) internal successors, (158), 143 states have internal predecessors, (158), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (17), 13 states have call predecessors, (17), 14 states have call successors, (17) [2023-02-17 05:51:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2023-02-17 05:51:43,181 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 110 [2023-02-17 05:51:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:51:43,181 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2023-02-17 05:51:43,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 4 states have call predecessors, (22), 9 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-02-17 05:51:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2023-02-17 05:51:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 05:51:43,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:51:43,183 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:51:43,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:51:43,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-17 05:51:43,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:51:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:51:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 614553281, now seen corresponding path program 1 times [2023-02-17 05:51:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:51:43,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140321123] [2023-02-17 05:51:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:51:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 05:51:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 05:51:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:51:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 05:51:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:51:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 05:51:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 05:51:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:51:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:51:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 87 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-17 05:51:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:51:46,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140321123] [2023-02-17 05:51:46,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140321123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:51:46,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751694479] [2023-02-17 05:51:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:51:46,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:51:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:51:46,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:51:46,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 05:51:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:51:46,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-17 05:51:46,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:51:46,571 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 11 treesize of output 7 [2023-02-17 05:51:46,600 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 [2023-02-17 05:51:46,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 05:51:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-17 05:51:46,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:51:46,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_180| Int) (v_ArrVal_2782 (Array Int Int))) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_180| v_ArrVal_2782) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))) (not (< |v_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base_180| |c_#StackHeapBarrier|)))) is different from false [2023-02-17 05:51:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751694479] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:51:46,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:51:46,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 31 [2023-02-17 05:51:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890745956] [2023-02-17 05:51:46,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:51:46,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 05:51:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:51:46,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 05:51:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=834, Unknown=18, NotChecked=58, Total=992 [2023-02-17 05:51:46,917 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand has 31 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 10 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (20), 6 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 05:51:49,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 05:51:51,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 05:51:53,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 05:51:57,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 05:51:59,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 05:52:02,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 05:52:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:52:02,866 INFO L93 Difference]: Finished difference Result 343 states and 429 transitions. [2023-02-17 05:52:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-17 05:52:02,867 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 10 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (20), 6 states have call predecessors, (20), 10 states have call successors, (20) Word has length 113 [2023-02-17 05:52:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:52:02,868 INFO L225 Difference]: With dead ends: 343 [2023-02-17 05:52:02,869 INFO L226 Difference]: Without dead ends: 179 [2023-02-17 05:52:02,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=329, Invalid=2614, Unknown=31, NotChecked=106, Total=3080 [2023-02-17 05:52:02,871 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 185 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 37 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-02-17 05:52:02,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1653 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1996 Invalid, 52 Unknown, 0 Unchecked, 13.4s Time] [2023-02-17 05:52:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-17 05:52:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2023-02-17 05:52:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 154 states have internal predecessors, (168), 29 states have call successors, (29), 11 states have call predecessors, (29), 12 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2023-02-17 05:52:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2023-02-17 05:52:02,887 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 113 [2023-02-17 05:52:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:52:02,887 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2023-02-17 05:52:02,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 27 states have internal predecessors, (87), 10 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (20), 6 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 05:52:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2023-02-17 05:52:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 05:52:02,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:52:02,893 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:52:02,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 05:52:03,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:52:03,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:52:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:52:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash 522299907, now seen corresponding path program 1 times [2023-02-17 05:52:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:52:03,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956565505] [2023-02-17 05:52:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:52:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:52:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:52:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:52:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:52:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 05:52:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 05:52:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 05:52:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 05:52:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 05:52:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:52:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 05:52:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:52:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 05:52:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat