./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 26d01a9c 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-?-26d01a9 [2023-02-17 00:27:07,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:27:07,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:27:07,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:27:07,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:27:07,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:27:07,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:27:07,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:27:07,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:27:07,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:27:07,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:27:07,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:27:07,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:27:07,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:27:07,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:27:07,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:27:07,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:27:07,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:27:07,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:27:07,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:27:07,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:27:07,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:27:07,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:27:07,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:27:07,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:27:07,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:27:07,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:27:07,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:27:07,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:27:07,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:27:07,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:27:07,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:27:07,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:27:07,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:27:07,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:27:07,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:27:07,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:27:07,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:27:07,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:27:07,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:27:07,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:27:07,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:27:08,004 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:27:08,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:27:08,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:27:08,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:27:08,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:27:08,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:27:08,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:27:08,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:27:08,008 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:27:08,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:27:08,009 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:27:08,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:27:08,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:27:08,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:27:08,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:27:08,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:27:08,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:27:08,010 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:27:08,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:27:08,010 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:27:08,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:27:08,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:27:08,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:27:08,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:27:08,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:27:08,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:27:08,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:27:08,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:27:08,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:27:08,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:27:08,013 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:27:08,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:27:08,013 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:27:08,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:27:08,013 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:27:08,014 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 00:27:08,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:27:08,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:27:08,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:27:08,293 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:27:08,293 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:27:08,294 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 00:27:09,449 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:27:09,679 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:27:09,680 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2023-02-17 00:27:09,691 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd83438ac/56093e2339d540b185516696be5f7499/FLAG1ec1d5f96 [2023-02-17 00:27:09,705 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd83438ac/56093e2339d540b185516696be5f7499 [2023-02-17 00:27:09,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:27:09,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:27:09,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:27:09,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:27:09,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:27:09,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:27:09" (1/1) ... [2023-02-17 00:27:09,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2998d70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:09, skipping insertion in model container [2023-02-17 00:27:09,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:27:09" (1/1) ... [2023-02-17 00:27:09,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:27:09,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:27:09,981 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 00:27:10,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:27:10,054 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:27:10,091 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 00:27:10,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:27:10,140 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:27:10,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10 WrapperNode [2023-02-17 00:27:10,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:27:10,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:27:10,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:27:10,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:27:10,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,205 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 228 [2023-02-17 00:27:10,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:27:10,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:27:10,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:27:10,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:27:10,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,248 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:27:10,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:27:10,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:27:10,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:27:10,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (1/1) ... [2023-02-17 00:27:10,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:27:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:27:10,297 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 00:27:10,340 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 00:27:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-17 00:27:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-17 00:27:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2023-02-17 00:27:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2023-02-17 00:27:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 00:27:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:27:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2023-02-17 00:27:10,357 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2023-02-17 00:27:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:27:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 00:27:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-02-17 00:27:10,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-02-17 00:27:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 00:27:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:27:10,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 00:27:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2023-02-17 00:27:10,381 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2023-02-17 00:27:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2023-02-17 00:27:10,381 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2023-02-17 00:27:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:27:10,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:27:10,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:27:10,549 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:27:10,551 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:27:10,895 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:27:10,901 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:27:10,902 INFO L300 CfgBuilder]: Removed 38 assume(true) statements. [2023-02-17 00:27:10,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:27:10 BoogieIcfgContainer [2023-02-17 00:27:10,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:27:10,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:27:10,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:27:10,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:27:10,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:27:09" (1/3) ... [2023-02-17 00:27:10,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5398b528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:27:10, skipping insertion in model container [2023-02-17 00:27:10,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:27:10" (2/3) ... [2023-02-17 00:27:10,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5398b528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:27:10, skipping insertion in model container [2023-02-17 00:27:10,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:27:10" (3/3) ... [2023-02-17 00:27:10,911 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2023-02-17 00:27:10,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:27:10,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:27:10,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:27:10,981 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;@69aa40bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:27:10,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:27:10,986 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 00:27:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 00:27:10,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:10,994 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 00:27:10,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 760908611, now seen corresponding path program 1 times [2023-02-17 00:27:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:11,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525966730] [2023-02-17 00:27:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:11,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:11,372 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 00:27:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:11,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525966730] [2023-02-17 00:27:11,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525966730] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:27:11,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:27:11,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:27:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937545329] [2023-02-17 00:27:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:27:11,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:27:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:27:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:27:11,423 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 00:27:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:11,665 INFO L93 Difference]: Finished difference Result 251 states and 429 transitions. [2023-02-17 00:27:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:27:11,667 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 00:27:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:11,674 INFO L225 Difference]: With dead ends: 251 [2023-02-17 00:27:11,674 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 00:27:11,678 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 00:27:11,681 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 00:27:11,683 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 00:27:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 00:27:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-17 00:27:11,718 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 00:27:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-17 00:27:11,721 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 37 [2023-02-17 00:27:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:11,721 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-17 00:27:11,722 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 00:27:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-17 00:27:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 00:27:11,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:11,724 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 00:27:11,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 00:27:11,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:11,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1675514385, now seen corresponding path program 1 times [2023-02-17 00:27:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:11,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786406868] [2023-02-17 00:27:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:11,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:12,438 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 00:27:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:12,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786406868] [2023-02-17 00:27:12,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786406868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:12,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604315396] [2023-02-17 00:27:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:12,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:27:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:27:12,449 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 00:27:12,477 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 00:27:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:12,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 00:27:12,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:27:12,734 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 00:27:12,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:27:12,829 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 00:27:12,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604315396] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:27:12,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:27:12,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 12 [2023-02-17 00:27:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071082278] [2023-02-17 00:27:12,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:27:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 00:27:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 00:27:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-17 00:27:12,839 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 00:27:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:13,285 INFO L93 Difference]: Finished difference Result 250 states and 324 transitions. [2023-02-17 00:27:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 00:27:13,285 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 00:27:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:13,287 INFO L225 Difference]: With dead ends: 250 [2023-02-17 00:27:13,287 INFO L226 Difference]: Without dead ends: 133 [2023-02-17 00:27:13,289 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 00:27:13,289 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.3s IncrementalHoareTripleChecker+Time [2023-02-17 00:27:13,290 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.3s Time] [2023-02-17 00:27:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-17 00:27:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-17 00:27:13,303 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 00:27:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2023-02-17 00:27:13,305 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 38 [2023-02-17 00:27:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:13,305 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2023-02-17 00:27:13,305 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 00:27:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2023-02-17 00:27:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-17 00:27:13,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:13,308 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 00:27:13,318 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 00:27:13,514 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 00:27:13,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 800158065, now seen corresponding path program 1 times [2023-02-17 00:27:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:13,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976887208] [2023-02-17 00:27:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 00:27:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 00:27:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 00:27:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 00:27:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 00:27:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:16,001 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 00:27:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976887208] [2023-02-17 00:27:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976887208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215055170] [2023-02-17 00:27:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:16,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:27:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:27:16,004 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 00:27:16,035 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 00:27:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:16,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-17 00:27:16,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:27:16,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:27:16,394 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 00:27:16,400 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 00:27:16,409 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 00:27:16,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:27:16,440 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 00:27:16,443 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:16,496 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_dll_insert_master_#in~dll#1.base|))) (let ((.cse4 (select .cse2 |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)) (.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (and (= .cse0 v_DerPreprocessor_2) (not (= .cse1 0)) (not (= .cse1 |c_dll_insert_master_#in~dll#1.base|)) (= .cse0 v_DerPreprocessor_3) (= .cse2 .cse3) (= .cse0 .cse3) (= .cse1 .cse4))))) (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 (= .cse5 v_DerPreprocessor_2) (not (= .cse6 0)) (not (= .cse6 |c_dll_insert_master_#in~dll#1.base|)) (= .cse5 (select |c_#memory_$Pointer$.base| .cse6)) (= .cse6 .cse4))))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse4)) (.cse8 (= |c_dll_insert_master_#in~dll#1.base| .cse4))) (and (= (select .cse7 |c_dll_insert_master_#in~dll#1.offset|) .cse4) (or (= .cse7 .cse2) (not .cse8)) .cse8 (not (= .cse4 0)))) (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 (= .cse9 v_DerPreprocessor_2) (not (= .cse10 0)) (not (= .cse10 |c_dll_insert_master_#in~dll#1.base|)) (= .cse9 v_DerPreprocessor_3) (= .cse9 (select |c_#memory_$Pointer$.base| .cse10)) (= .cse10 .cse4))))) (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 (= .cse11 v_DerPreprocessor_2) (not (= .cse12 0)) (not (= .cse12 |c_dll_insert_master_#in~dll#1.base|)) (= .cse2 .cse13) (= .cse11 .cse13) (= .cse12 .cse4)))))))) is different from true [2023-02-17 00:27:16,563 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|))) (let ((.cse2 (select .cse4 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (or (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 ((.cse1 (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)) (.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (and (= .cse0 .cse1) (= v_DerPreprocessor_2 .cse1) (= v_DerPreprocessor_3 .cse1) (= .cse2 .cse3) (not (= .cse3 0)) (= .cse0 .cse4) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse3)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_3 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|))) (let ((.cse6 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| v_DerPreprocessor_3) .cse7)) (.cse5 (select |c_#memory_$Pointer$.base| .cse7))) (and (= .cse5 .cse6) (= v_DerPreprocessor_2 .cse6) (= .cse2 .cse7) (not (= .cse7 0)) (= .cse5 .cse4) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse7)))))) (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 (= (select |c_#memory_$Pointer$.base| .cse8) .cse9) (= v_DerPreprocessor_2 .cse9) (= v_DerPreprocessor_3 .cse9) (= .cse2 .cse8) (not (= .cse8 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse8)))))) (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) .cse11) (= v_DerPreprocessor_2 .cse11) (= .cse2 .cse10) (not (= .cse10 0)) (not (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| .cse10)))))) (let ((.cse12 (= .cse2 |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| .cse2))) (and .cse12 (not (= .cse2 0)) (= .cse2 (select .cse13 |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|)) (or (not .cse12) (= .cse4 .cse13))))))) is different from true [2023-02-17 00:27:16,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:27:16,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 374 treesize of output 463 [2023-02-17 00:27:16,807 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 00:27:16,877 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 00:27:16,917 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 00:27:16,966 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 66 treesize of output 52 [2023-02-17 00:27:16,974 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:16,980 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 295 treesize of output 285 [2023-02-17 00:27:17,083 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 25 treesize of output 21 [2023-02-17 00:27:17,089 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,092 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 25 treesize of output 21 [2023-02-17 00:27:17,099 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,102 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,108 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,112 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 25 treesize of output 21 [2023-02-17 00:27:17,118 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,122 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 25 treesize of output 21 [2023-02-17 00:27:17,130 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,134 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,139 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,238 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,243 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,247 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,253 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,261 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,265 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,270 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,274 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,280 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,285 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,295 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,302 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,310 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,313 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,318 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,323 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,328 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,333 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,337 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,342 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,348 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,351 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,357 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,365 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,369 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,376 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,381 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,387 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,424 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,428 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,432 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,436 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,441 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,445 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,461 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,472 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,476 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,480 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,484 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,506 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 198 treesize of output 186 [2023-02-17 00:27:17,518 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,522 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,527 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,532 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,539 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 198 treesize of output 186 [2023-02-17 00:27:17,546 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,551 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,560 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,569 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,574 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,581 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,591 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,597 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,601 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,605 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,610 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,616 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,620 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,624 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,633 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,636 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,637 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,639 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,642 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 81 treesize of output 75 [2023-02-17 00:27:17,648 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,652 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 25 treesize of output 21 [2023-02-17 00:27:17,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-02-17 00:27:17,689 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,693 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,696 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,700 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 121 treesize of output 115 [2023-02-17 00:27:17,707 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,711 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 159 treesize of output 147 [2023-02-17 00:27:17,721 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,725 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,729 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 65 treesize of output 61 [2023-02-17 00:27:17,734 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,736 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,739 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:27:17,745 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 14 [2023-02-17 00:27:17,747 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 00:27:17,769 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 00:27:17,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:27:17,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:27:17,822 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 218 treesize of output 215 [2023-02-17 00:27:17,825 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 250 treesize of output 242 [2023-02-17 00:27:17,830 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 242 treesize of output 238 [2023-02-17 00:27:17,838 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 00:27:17,839 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,841 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,842 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,846 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 00:27:17,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:27:17,849 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,851 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,852 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,854 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,855 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,857 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,861 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:27:17,885 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 00:27:17,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2023-02-17 00:27:17,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2023-02-17 00:27:17,896 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 00:27:17,899 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 00:27:17,901 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:27:17,902 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,905 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,906 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,908 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:27:17,942 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 00:27:17,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215055170] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:27:17,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:27:17,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 29 [2023-02-17 00:27:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327336715] [2023-02-17 00:27:17,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:27:17,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 00:27:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:17,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 00:27:17,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=645, Unknown=3, NotChecked=102, Total=812 [2023-02-17 00:27:17,946 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 00:27:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:19,464 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2023-02-17 00:27:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 00:27:19,465 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 00:27:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:19,467 INFO L225 Difference]: With dead ends: 334 [2023-02-17 00:27:19,467 INFO L226 Difference]: Without dead ends: 205 [2023-02-17 00:27:19,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1978, Unknown=8, NotChecked=182, Total=2352 [2023-02-17 00:27:19,469 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 276 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 61 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:27:19,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1773 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1836 Invalid, 7 Unknown, 459 Unchecked, 1.1s Time] [2023-02-17 00:27:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-17 00:27:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 166. [2023-02-17 00:27:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 126 states have (on average 1.253968253968254) internal successors, (158), 144 states have internal predecessors, (158), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (17), 13 states have call predecessors, (17), 15 states have call successors, (17) [2023-02-17 00:27:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2023-02-17 00:27:19,488 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 110 [2023-02-17 00:27:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:19,489 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2023-02-17 00:27:19,489 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 00:27:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2023-02-17 00:27:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 00:27:19,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:19,492 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 00:27:19,502 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 00:27:19,699 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 00:27:19,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash 614553281, now seen corresponding path program 1 times [2023-02-17 00:27:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:19,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959255404] [2023-02-17 00:27:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 00:27:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 00:27:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 00:27:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 00:27:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 00:27:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-02-17 00:27:21,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:21,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959255404] [2023-02-17 00:27:21,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959255404] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:21,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824185791] [2023-02-17 00:27:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:27:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:27:21,621 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 00:27:21,650 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 00:27:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:21,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-17 00:27:21,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:27:22,059 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 00:27:22,092 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 00:27:22,210 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2702 (Array Int Int)) (|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| Int)) (and (< |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| v_ArrVal_2702) |c_##fun~$Pointer$~TO~VOID_#in~10#1.base|) |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) 0))) is different from true [2023-02-17 00:27:22,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 4 not checked. [2023-02-17 00:27:22,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:27:22,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824185791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:22,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:27:22,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2023-02-17 00:27:22,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544771687] [2023-02-17 00:27:22,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:27:22,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 00:27:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 00:27:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=479, Unknown=19, NotChecked=44, Total=600 [2023-02-17 00:27:22,378 INFO L87 Difference]: Start difference. First operand 166 states and 204 transitions. Second operand has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 8 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2023-02-17 00:27:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:29,882 INFO L93 Difference]: Finished difference Result 342 states and 424 transitions. [2023-02-17 00:27:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 00:27:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 8 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) Word has length 113 [2023-02-17 00:27:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:29,884 INFO L225 Difference]: With dead ends: 342 [2023-02-17 00:27:29,884 INFO L226 Difference]: Without dead ends: 180 [2023-02-17 00:27:29,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=224, Invalid=1555, Unknown=31, NotChecked=82, Total=1892 [2023-02-17 00:27:29,886 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 122 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 28 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:27:29,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1325 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1551 Invalid, 40 Unknown, 163 Unchecked, 1.0s Time] [2023-02-17 00:27:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-17 00:27:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2023-02-17 00:27:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 135 states have (on average 1.237037037037037) internal successors, (167), 153 states have internal predecessors, (167), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-17 00:27:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2023-02-17 00:27:29,902 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 113 [2023-02-17 00:27:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:29,902 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2023-02-17 00:27:29,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 8 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (17), 5 states have call predecessors, (17), 8 states have call successors, (17) [2023-02-17 00:27:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2023-02-17 00:27:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 00:27:29,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:29,904 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 00:27:29,919 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 00:27:30,114 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 00:27:30,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash 522299907, now seen corresponding path program 1 times [2023-02-17 00:27:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:30,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733449958] [2023-02-17 00:27:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 00:27:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 00:27:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-17 00:27:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 00:27:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-17 00:27:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 00:27:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 00:27:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-02-17 00:27:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat