./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-data/packet_filter.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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:45:50,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:45:50,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:45:50,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:45:50,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:45:50,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:45:50,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:45:50,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:45:50,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:45:50,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:45:50,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:45:50,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:45:50,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:45:50,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:45:50,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:45:50,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:45:50,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:45:50,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:45:50,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:45:50,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:45:50,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:45:50,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:45:50,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:45:50,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:45:50,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:45:50,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:45:50,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:45:50,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:45:50,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:45:50,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:45:50,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:45:50,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:45:50,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:45:50,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:45:50,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:45:50,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:45:50,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:45:50,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:45:50,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:45:50,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:45:50,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:45:50,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:45:50,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:45:50,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:45:50,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:45:50,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:45:50,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:45:50,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:45:50,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:45:50,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:45:50,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:45:50,376 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:45:50,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:45:50,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:45:50,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:45:50,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:45:50,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:45:50,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:45:50,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:45:50,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:45:50,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:45:50,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:45:50,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:45:50,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:45:50,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:45:50,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:45:50,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:45:50,379 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:45:50,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:45:50,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:45:50,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2022-07-19 14:45:50,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:45:50,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:45:50,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:45:50,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:45:50,554 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:45:50,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2022-07-19 14:45:50,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9eeca77/caab15547f3a4ec0889235609308ac93/FLAGd48db58c4 [2022-07-19 14:45:51,014 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:45:51,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2022-07-19 14:45:51,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9eeca77/caab15547f3a4ec0889235609308ac93/FLAGd48db58c4 [2022-07-19 14:45:51,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9eeca77/caab15547f3a4ec0889235609308ac93 [2022-07-19 14:45:51,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:45:51,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:45:51,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:45:51,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:45:51,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:45:51,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb4a053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51, skipping insertion in model container [2022-07-19 14:45:51,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:45:51,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:45:51,343 WARN L230 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-data/packet_filter.i[23925,23938] [2022-07-19 14:45:51,352 WARN L230 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-data/packet_filter.i[24159,24172] [2022-07-19 14:45:51,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:45:51,376 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:45:51,413 WARN L230 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-data/packet_filter.i[23925,23938] [2022-07-19 14:45:51,414 WARN L230 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-data/packet_filter.i[24159,24172] [2022-07-19 14:45:51,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:45:51,437 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:45:51,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51 WrapperNode [2022-07-19 14:45:51,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:45:51,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:45:51,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:45:51,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:45:51,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,488 INFO L137 Inliner]: procedures = 130, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-07-19 14:45:51,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:45:51,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:45:51,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:45:51,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:45:51,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:45:51,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:45:51,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:45:51,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:45:51,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (1/1) ... [2022-07-19 14:45:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:45:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:51,551 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) [2022-07-19 14:45:51,576 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 [2022-07-19 14:45:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:45:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2022-07-19 14:45:51,581 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:45:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2022-07-19 14:45:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure send [2022-07-19 14:45:51,582 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2022-07-19 14:45:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:45:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:45:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:45:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:45:51,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:45:51,709 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:45:51,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:45:51,907 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:45:51,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:45:51,916 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 14:45:51,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:45:51 BoogieIcfgContainer [2022-07-19 14:45:51,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:45:51,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:45:51,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:45:51,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:45:51,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:45:51" (1/3) ... [2022-07-19 14:45:51,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cc96f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:45:51, skipping insertion in model container [2022-07-19 14:45:51,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:45:51" (2/3) ... [2022-07-19 14:45:51,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cc96f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:45:51, skipping insertion in model container [2022-07-19 14:45:51,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:45:51" (3/3) ... [2022-07-19 14:45:51,925 INFO L111 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2022-07-19 14:45:51,955 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:45:51,955 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 14:45:51,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:45:52,000 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60e912b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d697324 [2022-07-19 14:45:52,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 14:45:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 14:45:52,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:52,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:52,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1910004341, now seen corresponding path program 1 times [2022-07-19 14:45:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:52,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216815523] [2022-07-19 14:45:52,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:52,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216815523] [2022-07-19 14:45:52,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216815523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:52,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:52,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:45:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911491467] [2022-07-19 14:45:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:52,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:45:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:52,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:45:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:45:52,156 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:52,169 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-07-19 14:45:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:45:52,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 14:45:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:52,175 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:45:52,175 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 14:45:52,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:45:52,179 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:52,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:45:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 14:45:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-19 14:45:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-07-19 14:45:52,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 8 [2022-07-19 14:45:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:52,205 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-07-19 14:45:52,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-07-19 14:45:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-19 14:45:52,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:52,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:52,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:45:52,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:52,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1345079117, now seen corresponding path program 1 times [2022-07-19 14:45:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098877362] [2022-07-19 14:45:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:52,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098877362] [2022-07-19 14:45:52,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098877362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:52,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:52,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:45:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994952303] [2022-07-19 14:45:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:52,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:45:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:45:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:45:52,264 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:52,350 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-07-19 14:45:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:45:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-19 14:45:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:52,354 INFO L225 Difference]: With dead ends: 77 [2022-07-19 14:45:52,354 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 14:45:52,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:45:52,358 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:52,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 122 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:45:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 14:45:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-07-19 14:45:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-07-19 14:45:52,368 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 9 [2022-07-19 14:45:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:52,368 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-19 14:45:52,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-07-19 14:45:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:45:52,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:52,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:52,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:45:52,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash 124171370, now seen corresponding path program 1 times [2022-07-19 14:45:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:52,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793766453] [2022-07-19 14:45:52,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:52,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:52,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793766453] [2022-07-19 14:45:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793766453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:52,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:52,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:45:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980848908] [2022-07-19 14:45:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:45:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:45:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:45:52,435 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:52,496 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-19 14:45:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:45:52,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:45:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:52,498 INFO L225 Difference]: With dead ends: 61 [2022-07-19 14:45:52,498 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:45:52,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:45:52,499 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:52,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:45:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:45:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-19 14:45:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-07-19 14:45:52,503 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 11 [2022-07-19 14:45:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:52,504 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-07-19 14:45:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-07-19 14:45:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:45:52,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:52,505 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:52,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:45:52,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 959773065, now seen corresponding path program 1 times [2022-07-19 14:45:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:52,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955075488] [2022-07-19 14:45:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:52,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955075488] [2022-07-19 14:45:52,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955075488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:52,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864397163] [2022-07-19 14:45:52,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:52,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:52,640 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) [2022-07-19 14:45:52,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:45:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:52,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 14:45:52,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:52,811 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:45:52,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:45:52,841 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:45:52,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:45:52,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:52,862 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:45:52,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:45:52,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:52,876 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:45:52,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:45:52,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:45:52,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:45:52,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:45:52,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:45:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:52,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:52,964 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_84 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_83 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_83) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-07-19 14:45:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:53,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864397163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:53,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:53,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-07-19 14:45:53,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575948850] [2022-07-19 14:45:53,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:53,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:45:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:53,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:45:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2022-07-19 14:45:53,051 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:53,216 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-07-19 14:45:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:45:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 14:45:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:53,218 INFO L225 Difference]: With dead ends: 90 [2022-07-19 14:45:53,218 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 14:45:53,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=59, Unknown=1, NotChecked=16, Total=110 [2022-07-19 14:45:53,220 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:53,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 224 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-07-19 14:45:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 14:45:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2022-07-19 14:45:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-07-19 14:45:53,230 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 16 [2022-07-19 14:45:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:53,231 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-07-19 14:45:53,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-07-19 14:45:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:45:53,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:53,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:53,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:45:53,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:53,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:53,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1116006464, now seen corresponding path program 1 times [2022-07-19 14:45:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963419514] [2022-07-19 14:45:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:53,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963419514] [2022-07-19 14:45:53,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963419514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:53,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650480646] [2022-07-19 14:45:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:53,543 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) [2022-07-19 14:45:53,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:45:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:53,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 14:45:53,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:53,647 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:45:53,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 14:45:53,684 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:45:53,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:45:53,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:53,704 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:45:53,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:45:53,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:45:53,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:45:53,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:45:53,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:45:53,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:45:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:53,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:53,815 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_152 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_150) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2022-07-19 14:45:53,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_13| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_8| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_13| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_8|) 0)) (and (forall ((v_ArrVal_152 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_8| v_ArrVal_152) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|))) (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_8| v_ArrVal_150) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))))) is different from false [2022-07-19 14:45:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 14:45:53,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650480646] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:53,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:53,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-07-19 14:45:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591008416] [2022-07-19 14:45:53,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:53,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:45:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:53,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:45:53,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=39, Unknown=2, NotChecked=26, Total=90 [2022-07-19 14:45:53,893 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:54,066 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-07-19 14:45:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:45:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 14:45:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:54,067 INFO L225 Difference]: With dead ends: 74 [2022-07-19 14:45:54,068 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 14:45:54,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=73, Unknown=2, NotChecked=38, Total=156 [2022-07-19 14:45:54,068 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:54,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 278 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-07-19 14:45:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 14:45:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-19 14:45:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-07-19 14:45:54,074 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 18 [2022-07-19 14:45:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:54,074 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-07-19 14:45:54,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:45:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-07-19 14:45:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:45:54,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:54,075 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:54,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:45:54,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:54,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2078493544, now seen corresponding path program 1 times [2022-07-19 14:45:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:54,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758894597] [2022-07-19 14:45:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:45:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758894597] [2022-07-19 14:45:54,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758894597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:45:54,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:45:54,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:45:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29762328] [2022-07-19 14:45:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:45:54,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:45:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:54,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:45:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:45:54,431 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:45:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:54,591 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2022-07-19 14:45:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:45:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-07-19 14:45:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:54,592 INFO L225 Difference]: With dead ends: 132 [2022-07-19 14:45:54,592 INFO L226 Difference]: Without dead ends: 91 [2022-07-19 14:45:54,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:45:54,593 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:54,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 354 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:45:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-19 14:45:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-07-19 14:45:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:45:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-07-19 14:45:54,598 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 22 [2022-07-19 14:45:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:54,598 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-07-19 14:45:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:45:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-07-19 14:45:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:45:54,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:54,603 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:54,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:45:54,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 222329046, now seen corresponding path program 1 times [2022-07-19 14:45:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332723769] [2022-07-19 14:45:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:45:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:54,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332723769] [2022-07-19 14:45:54,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332723769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94254285] [2022-07-19 14:45:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:54,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:54,916 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) [2022-07-19 14:45:54,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:45:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:55,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-19 14:45:55,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:55,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-07-19 14:45:55,177 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:45:55,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:45:55,202 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:45:55,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:45:55,241 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:45:55,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:45:55,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:45:55,288 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-19 14:45:55,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2022-07-19 14:45:55,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:45:55,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:45:55,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:45:55,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:55,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:55,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:55,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-07-19 14:45:55,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:55,541 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-19 14:45:55,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 81 [2022-07-19 14:45:55,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 31 [2022-07-19 14:45:55,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:55,744 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:45:55,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 56 [2022-07-19 14:45:55,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 39 [2022-07-19 14:45:55,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:45:55,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:55,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:56,057 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:45:56,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-19 14:45:56,064 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:45:56,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-19 14:45:56,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-19 14:45:56,153 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-19 14:45:56,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-19 14:45:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94254285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:56,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 25 [2022-07-19 14:45:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359524205] [2022-07-19 14:45:56,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:56,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 14:45:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 14:45:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-19 14:45:56,228 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:45:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:56,664 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2022-07-19 14:45:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 14:45:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-07-19 14:45:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:56,665 INFO L225 Difference]: With dead ends: 147 [2022-07-19 14:45:56,665 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 14:45:56,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 14:45:56,666 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:56,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 453 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 287 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2022-07-19 14:45:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 14:45:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 79. [2022-07-19 14:45:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.289855072463768) internal successors, (89), 70 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:45:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2022-07-19 14:45:56,673 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 22 [2022-07-19 14:45:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:56,673 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2022-07-19 14:45:56,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:45:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-07-19 14:45:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 14:45:56,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:56,674 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:56,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 14:45:56,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:56,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash -749095909, now seen corresponding path program 1 times [2022-07-19 14:45:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:56,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293856614] [2022-07-19 14:45:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:45:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:45:57,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293856614] [2022-07-19 14:45:57,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293856614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:45:57,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591306522] [2022-07-19 14:45:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:57,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:57,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:45:57,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:45:57,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:45:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:45:57,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 14:45:57,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:45:57,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 14:45:57,408 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:45:57,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:45:57,435 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:45:57,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:45:57,459 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:45:57,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:45:57,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:45:57,497 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-19 14:45:57,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2022-07-19 14:45:57,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:45:57,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:45:57,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:45:57,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:57,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:57,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:57,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-19 14:45:57,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:45:57,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:57,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:45:57,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2022-07-19 14:45:57,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:45:58,185 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-19 14:45:58,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 202 [2022-07-19 14:45:58,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:45:58,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 210 treesize of output 196 [2022-07-19 14:45:58,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 26 [2022-07-19 14:45:58,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 58 [2022-07-19 14:45:58,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 57 [2022-07-19 14:45:58,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 31 [2022-07-19 14:45:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:58,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:45:58,554 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:45:58,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-19 14:45:58,561 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:45:58,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-19 14:45:58,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-19 14:45:58,654 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-19 14:45:58,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-19 14:45:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:45:58,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591306522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:45:58,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:45:58,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-19 14:45:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802833984] [2022-07-19 14:45:58,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:45:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 14:45:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:45:58,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 14:45:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=644, Unknown=2, NotChecked=0, Total=756 [2022-07-19 14:45:58,772 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 28 states, 24 states have (on average 2.375) internal successors, (57), 27 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:45:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:45:59,642 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2022-07-19 14:45:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 14:45:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.375) internal successors, (57), 27 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-07-19 14:45:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:45:59,644 INFO L225 Difference]: With dead ends: 123 [2022-07-19 14:45:59,644 INFO L226 Difference]: Without dead ends: 121 [2022-07-19 14:45:59,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1201, Unknown=7, NotChecked=0, Total=1406 [2022-07-19 14:45:59,645 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 132 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:45:59,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 760 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 434 Invalid, 0 Unknown, 195 Unchecked, 0.3s Time] [2022-07-19 14:45:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-19 14:45:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2022-07-19 14:45:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 79 states have internal predecessors, (102), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 14:45:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2022-07-19 14:45:59,653 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 23 [2022-07-19 14:45:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:45:59,653 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2022-07-19 14:45:59,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.375) internal successors, (57), 27 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:45:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2022-07-19 14:45:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 14:45:59,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:45:59,654 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:45:59,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:45:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:45:59,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:45:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:45:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1903920603, now seen corresponding path program 1 times [2022-07-19 14:45:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:45:59,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372330808] [2022-07-19 14:45:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:45:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:45:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:46:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:20,735 WARN L233 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:46:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:30,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372330808] [2022-07-19 14:46:30,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372330808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:30,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693963560] [2022-07-19 14:46:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:30,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:30,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:30,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:46:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:30,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-19 14:46:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:30,835 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:46:30,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:46:30,917 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:46:30,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:46:30,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:30,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:31,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:31,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:31,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-19 14:46:31,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:46:31,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:46:31,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:46:31,178 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1218) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1219) |c_#memory_$Pointer$.base|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1215) append_to_queue_~node~0.base v_ArrVal_1223) |c_append_to_queue_#in~q.base| v_ArrVal_1214) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0))) is different from true [2022-07-19 14:46:31,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:31,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:31,229 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 14:46:31,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-07-19 14:46:31,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:31,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:31,253 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 14:46:31,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-07-19 14:46:31,267 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:46:31,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 14:46:31,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:46:31,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:46:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:31,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:33,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693963560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:33,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:46:33,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-07-19 14:46:33,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651153794] [2022-07-19 14:46:33,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:33,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 14:46:33,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 14:46:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=136, Unknown=2, NotChecked=24, Total=210 [2022-07-19 14:46:33,531 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:46:36,126 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse13 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse25 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse24 (@diff .cse25 |c_#memory_$Pointer$.offset|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse7 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5))) (.cse3 (store .cse25 .cse24 (select |c_#memory_$Pointer$.offset| .cse24)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$.offset|)) (.cse8 (@diff .cse7 |c_#memory_$Pointer$.base|))) (let ((.cse15 (store .cse7 .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (.cse23 (store .cse3 .cse2 (select |c_#memory_$Pointer$.offset| .cse2)))) (let ((.cse22 (@diff .cse23 |c_#memory_$Pointer$.offset|)) (.cse14 (@diff .cse15 |c_#memory_$Pointer$.base|))) (let ((.cse1 (store .cse15 .cse14 (select |c_#memory_$Pointer$.base| .cse14))) (.cse21 (store .cse23 .cse22 (select |c_#memory_$Pointer$.offset| .cse22)))) (let ((.cse20 (@diff .cse21 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#memory_$Pointer$.base|))) (let ((.cse10 (store .cse1 .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (.cse11 (store .cse21 .cse20 (select |c_#memory_$Pointer$.offset| .cse20)))) (let ((.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|)) (.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|))) (let ((.cse18 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9))) (.cse16 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12)))) (let ((.cse17 (@diff .cse16 |c_#memory_$Pointer$.offset|)) (.cse19 (@diff .cse18 |c_#memory_$Pointer$.base|))) (and (exists ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1218) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1219) |c_#memory_$Pointer$.base|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1215) append_to_queue_~node~0.base v_ArrVal_1223) |c_append_to_queue_#in~q.base| v_ArrVal_1214) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0))) (or (= (select |c_old(#valid)| .cse0) 0) (= .cse0 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse1) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse3) (= (select |c_old(#valid)| .cse2) 0)) (or (= (select |c_old(#valid)| .cse4) 0) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6) (= .cse5 |c_append_to_queue_#in~q.base|) (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse7) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse8) 0) (= .cse8 |c_append_to_queue_#in~q.base|)) (or (= (select |c_old(#valid)| .cse9) 0) (= .cse10 |c_#memory_$Pointer$.base|) (<= (+ .cse9 1) |c_#StackHeapBarrier|) (= .cse9 |c_append_to_queue_#in~q.base|)) (or (= .cse11 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse12) 0) (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= .cse12 |c_append_to_queue_#in~q.base|)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse13) 0) (= .cse13 |c_append_to_queue_#in~q.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse14) 0) (= |c_#memory_$Pointer$.base| .cse15) (= .cse14 |c_append_to_queue_#in~q.base|) (<= (+ .cse14 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse16 .cse17 (select |c_#memory_$Pointer$.offset| .cse17))) (or (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (= .cse16 |c_#memory_$Pointer$.offset|)) (= |c_#memory_$Pointer$.base| (store .cse18 .cse19 (select |c_#memory_$Pointer$.base| .cse19))) (or (= (select |c_old(#valid)| .cse20) 0) (<= (+ .cse20 1) |c_#StackHeapBarrier|) (= .cse21 |c_#memory_$Pointer$.offset|) (= .cse20 |c_append_to_queue_#in~q.base|)) (or (= .cse22 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse23) (= (select |c_old(#valid)| .cse22) 0) (<= (+ .cse22 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse18) (<= (+ .cse19 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse19) 0) (= |c_append_to_queue_#in~q.base| .cse19)) (or (= .cse24 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse25) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-07-19 14:46:38,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:46:41,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:46:43,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:46:46,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:46:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:46,127 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2022-07-19 14:46:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:46:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-07-19 14:46:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:46,133 INFO L225 Difference]: With dead ends: 137 [2022-07-19 14:46:46,133 INFO L226 Difference]: Without dead ends: 114 [2022-07-19 14:46:46,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=82, Invalid=229, Unknown=3, NotChecked=66, Total=380 [2022-07-19 14:46:46,134 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 75 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:46,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 261 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 162 Invalid, 4 Unknown, 134 Unchecked, 10.3s Time] [2022-07-19 14:46:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-19 14:46:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-07-19 14:46:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 85 states have internal predecessors, (109), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 14:46:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2022-07-19 14:46:46,146 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 23 [2022-07-19 14:46:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:46,146 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2022-07-19 14:46:46,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:46:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2022-07-19 14:46:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:46:46,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:46,146 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:46,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:46,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:46,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1130104883, now seen corresponding path program 1 times [2022-07-19 14:46:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:46,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998994808] [2022-07-19 14:46:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:46:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:46,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998994808] [2022-07-19 14:46:46,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998994808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:46,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:46,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:46:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339784398] [2022-07-19 14:46:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:46,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:46:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:46:46,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:46:46,447 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:46:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:46,592 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2022-07-19 14:46:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:46:46,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-19 14:46:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:46,593 INFO L225 Difference]: With dead ends: 123 [2022-07-19 14:46:46,593 INFO L226 Difference]: Without dead ends: 110 [2022-07-19 14:46:46,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:46:46,594 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:46,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 186 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:46:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-19 14:46:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-07-19 14:46:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 90 states have internal predecessors, (113), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 14:46:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2022-07-19 14:46:46,604 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 24 [2022-07-19 14:46:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:46,604 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2022-07-19 14:46:46,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:46:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2022-07-19 14:46:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:46:46,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:46,608 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 14:46:46,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -28321902, now seen corresponding path program 1 times [2022-07-19 14:46:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245303010] [2022-07-19 14:46:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:46:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:46,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:46,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245303010] [2022-07-19 14:46:46,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245303010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:46,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594947081] [2022-07-19 14:46:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:46,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:46,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:46,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 14:46:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:47,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 14:46:47,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:47,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 10 [2022-07-19 14:46:47,278 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:46:47,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:46:47,304 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:47,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:47,328 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:47,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:47,358 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-19 14:46:47,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-07-19 14:46:47,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:47,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:47,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:47,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:46:47,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:47,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:47,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-19 14:46:47,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:46:47,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-07-19 14:46:47,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:47,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 32 [2022-07-19 14:46:47,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:46:47,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 29 [2022-07-19 14:46:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:47,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:48,011 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:46:48,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-19 14:46:48,018 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:46:48,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-19 14:46:48,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-19 14:46:48,100 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-19 14:46:48,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-19 14:46:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:48,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594947081] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:48,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:48,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 26 [2022-07-19 14:46:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922440327] [2022-07-19 14:46:48,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:48,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 14:46:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:48,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 14:46:48,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-07-19 14:46:48,211 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 26 states, 23 states have (on average 2.652173913043478) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:46:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:48,778 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-07-19 14:46:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:46:48,778 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.652173913043478) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-07-19 14:46:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:48,779 INFO L225 Difference]: With dead ends: 124 [2022-07-19 14:46:48,779 INFO L226 Difference]: Without dead ends: 122 [2022-07-19 14:46:48,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2022-07-19 14:46:48,780 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:48,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 553 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 357 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2022-07-19 14:46:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-19 14:46:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-07-19 14:46:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.263157894736842) internal successors, (120), 96 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 14:46:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2022-07-19 14:46:48,791 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 25 [2022-07-19 14:46:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:48,791 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 136 transitions. [2022-07-19 14:46:48,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.652173913043478) internal successors, (61), 25 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:46:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2022-07-19 14:46:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:46:48,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:48,794 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:48,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:48,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:48,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -28319980, now seen corresponding path program 1 times [2022-07-19 14:46:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:48,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111170031] [2022-07-19 14:46:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:49,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:46:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:49,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111170031] [2022-07-19 14:46:49,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111170031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:49,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842733911] [2022-07-19 14:46:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:49,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:49,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:49,233 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:49,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 14:46:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:49,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-19 14:46:49,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:49,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 15 [2022-07-19 14:46:49,607 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 14:46:49,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 10 [2022-07-19 14:46:49,657 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:46:49,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:46:49,681 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:49,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:49,704 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:49,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:49,733 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-19 14:46:49,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-07-19 14:46:49,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:49,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:49,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:46:49,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:49,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:49,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:49,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-19 14:46:49,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:49,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-19 14:46:49,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:46:50,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 35 [2022-07-19 14:46:50,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-19 14:46:50,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-19 14:46:50,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 21 [2022-07-19 14:46:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:50,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:50,440 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:46:50,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-19 14:46:50,447 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:46:50,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-19 14:46:50,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-19 14:46:50,534 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-19 14:46:50,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-19 14:46:50,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 307 treesize of output 289 [2022-07-19 14:46:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:50,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842733911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:50,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:50,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-07-19 14:46:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371086165] [2022-07-19 14:46:50,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:50,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 14:46:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 14:46:50,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=808, Unknown=1, NotChecked=0, Total=930 [2022-07-19 14:46:50,889 INFO L87 Difference]: Start difference. First operand 107 states and 136 transitions. Second operand has 31 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:46:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:51,462 INFO L93 Difference]: Finished difference Result 160 states and 203 transitions. [2022-07-19 14:46:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 14:46:51,463 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-07-19 14:46:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:51,464 INFO L225 Difference]: With dead ends: 160 [2022-07-19 14:46:51,464 INFO L226 Difference]: Without dead ends: 148 [2022-07-19 14:46:51,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=1043, Unknown=1, NotChecked=0, Total=1190 [2022-07-19 14:46:51,464 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:51,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 729 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 321 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2022-07-19 14:46:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-19 14:46:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2022-07-19 14:46:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 117 states have internal predecessors, (146), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:46:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2022-07-19 14:46:51,474 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 25 [2022-07-19 14:46:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:51,474 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2022-07-19 14:46:51,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:46:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2022-07-19 14:46:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:46:51,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:51,475 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:51,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:51,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:51,694 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1025087574, now seen corresponding path program 2 times [2022-07-19 14:46:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:51,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507015093] [2022-07-19 14:46:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507015093] [2022-07-19 14:46:51,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507015093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981223385] [2022-07-19 14:46:51,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:46:51,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:51,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:51,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:51,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 14:46:52,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:46:52,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:46:52,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-19 14:46:52,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:52,068 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:52,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 14:46:52,090 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:52,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:46:52,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:52,117 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:52,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:46:52,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:52,147 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:46:52,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:46:52,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-19 14:46:52,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:52,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:52,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-19 14:46:52,266 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:52,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:46:52,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:52,278 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:46:52,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:46:52,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:52,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:52,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:52,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:46:52,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:46:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:46:52,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:52,377 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2169) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2167 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2022-07-19 14:46:52,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_24| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_19| Int)) (or (and (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_19| v_ArrVal_2169) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2167 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_19| v_ArrVal_2167) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_2161) |v_ULTIMATE.start_main_~#new_packet~0#1.base_24| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_19|) 0)))) is different from false [2022-07-19 14:46:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-19 14:46:52,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981223385] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:52,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:52,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-07-19 14:46:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305856589] [2022-07-19 14:46:52,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:52,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:46:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:46:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=114, Unknown=11, NotChecked=50, Total=240 [2022-07-19 14:46:52,747 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:46:53,258 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (forall ((v_ArrVal_2161 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_24| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_19| Int)) (or (and (forall ((v_ArrVal_2169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_19| v_ArrVal_2169) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2167 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_19| v_ArrVal_2167) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_2161) |v_ULTIMATE.start_main_~#new_packet~0#1.base_24| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_19|) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from false [2022-07-19 14:46:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:53,275 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-07-19 14:46:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:46:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 14:46:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:53,276 INFO L225 Difference]: With dead ends: 144 [2022-07-19 14:46:53,276 INFO L226 Difference]: Without dead ends: 128 [2022-07-19 14:46:53,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=12, NotChecked=78, Total=272 [2022-07-19 14:46:53,277 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:53,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 65 Unchecked, 0.0s Time] [2022-07-19 14:46:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-19 14:46:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2022-07-19 14:46:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 109 states have internal predecessors, (136), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:46:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2022-07-19 14:46:53,286 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 25 [2022-07-19 14:46:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:53,286 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2022-07-19 14:46:53,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:46:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2022-07-19 14:46:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:46:53,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:53,287 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:53,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:53,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 14:46:53,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1069112326, now seen corresponding path program 1 times [2022-07-19 14:46:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:53,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684625452] [2022-07-19 14:46:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:46:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684625452] [2022-07-19 14:46:53,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684625452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790704880] [2022-07-19 14:46:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:53,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:53,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 14:46:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:54,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-19 14:46:54,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:54,163 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:46:54,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:46:54,213 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:46:54,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:46:54,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-19 14:46:54,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-19 14:46:54,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:46:54,450 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:46:54,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:46:54,476 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:54,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:54,501 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:54,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:54,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:54,543 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-19 14:46:54,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2022-07-19 14:46:54,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:54,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:54,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:46:54,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:54,614 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:46:54,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:54,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:54,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-19 14:46:54,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:54,752 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-19 14:46:54,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 147 [2022-07-19 14:46:54,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 68 [2022-07-19 14:46:55,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:55,053 INFO L356 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2022-07-19 14:46:55,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 58 [2022-07-19 14:46:55,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-19 14:46:55,411 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-19 14:46:55,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 108 [2022-07-19 14:46:55,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:55,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:55,437 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:55,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-19 14:46:55,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:55,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:55,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-19 14:46:55,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:55,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:46:55,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 24 [2022-07-19 14:46:55,489 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:46:55,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:46:55,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-19 14:46:55,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:55,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-19 14:46:55,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:46:55,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-19 14:46:55,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:46:55,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 27 [2022-07-19 14:46:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:55,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:55,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2513) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2510) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) 4294967296) 1)) is different from false [2022-07-19 14:46:55,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_23| Int) (v_ArrVal_2513 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_28| Int) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_28| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_23|) 0)) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_23| v_ArrVal_2513) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_23| v_ArrVal_2510) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_23| v_ArrVal_2509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_23|)))) is different from false [2022-07-19 14:46:55,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_23| Int) (v_ArrVal_2513 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_28| Int) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2503 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_2503) |v_ULTIMATE.start_main_~#new_packet~0#1.base_28| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_23|) 0)) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_23| v_ArrVal_2513) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_23| v_ArrVal_2510) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_23| v_ArrVal_2509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_23|)))) is different from false [2022-07-19 14:46:56,197 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:46:56,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 104 treesize of output 126 [2022-07-19 14:46:56,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:56,359 INFO L356 Elim1Store]: treesize reduction 82, result has 57.5 percent of original size [2022-07-19 14:46:56,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 488 treesize of output 538 [2022-07-19 14:46:56,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 482 treesize of output 456 [2022-07-19 14:46:56,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:56,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 380 [2022-07-19 14:46:56,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 373 treesize of output 307 [2022-07-19 14:46:56,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:56,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 245 [2022-07-19 14:46:56,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790704880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:56,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:46:56,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2022-07-19 14:46:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571188837] [2022-07-19 14:46:56,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:56,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 14:46:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 14:46:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=829, Unknown=3, NotChecked=180, Total=1122 [2022-07-19 14:46:56,699 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:46:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:58,116 INFO L93 Difference]: Finished difference Result 241 states and 316 transitions. [2022-07-19 14:46:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 14:46:58,116 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-07-19 14:46:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:58,117 INFO L225 Difference]: With dead ends: 241 [2022-07-19 14:46:58,117 INFO L226 Difference]: Without dead ends: 179 [2022-07-19 14:46:58,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=2031, Unknown=20, NotChecked=288, Total=2652 [2022-07-19 14:46:58,118 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:58,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 706 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 877 Invalid, 0 Unknown, 139 Unchecked, 0.8s Time] [2022-07-19 14:46:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-19 14:46:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 144. [2022-07-19 14:46:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 131 states have internal predecessors, (167), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:46:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2022-07-19 14:46:58,135 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 29 [2022-07-19 14:46:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:58,136 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2022-07-19 14:46:58,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:46:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2022-07-19 14:46:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:46:58,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:58,137 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:58,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:58,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 14:46:58,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash 8968481, now seen corresponding path program 1 times [2022-07-19 14:46:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609398384] [2022-07-19 14:46:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:46:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609398384] [2022-07-19 14:46:58,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609398384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156125899] [2022-07-19 14:46:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:58,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:58,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:58,797 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:58,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 14:46:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:59,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-19 14:46:59,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:59,056 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:46:59,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:46:59,096 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:46:59,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:46:59,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-19 14:46:59,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-07-19 14:46:59,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:46:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2022-07-19 14:46:59,436 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:59,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:59,463 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:46:59,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:46:59,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,497 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 14:46:59,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-07-19 14:46:59,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:59,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:46:59,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:59,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:46:59,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:59,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:59,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-07-19 14:46:59,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:46:59,633 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-19 14:46:59,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 49 [2022-07-19 14:46:59,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 34 [2022-07-19 14:47:04,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,114 INFO L356 Elim1Store]: treesize reduction 102, result has 26.1 percent of original size [2022-07-19 14:47:04,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 61 [2022-07-19 14:47:04,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-19 14:47:04,348 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:47:04,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:47:04,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:47:04,364 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:47:04,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 81 [2022-07-19 14:47:04,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,379 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:47:04,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 14:47:04,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:47:04,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-19 14:47:04,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 14:47:04,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-19 14:47:04,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:47:04,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-19 14:47:04,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:47:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:04,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:04,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2906 (Array Int Int)) (v_ArrVal_2905 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2906) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2905) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500)) is different from false [2022-07-19 14:47:04,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_2906 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_30| Int) (v_ArrVal_2905 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_30| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)) (< (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_2906) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_2903) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_2905) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_26|)))) is different from false [2022-07-19 14:47:04,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_2896 Int) (v_ArrVal_2906 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_30| Int) (v_ArrVal_2905 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (or (< (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_2906) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_2903) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_2905) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_2896) |v_ULTIMATE.start_main_~#new_packet~0#1.base_30| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_26|)))) is different from false [2022-07-19 14:47:04,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:04,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:04,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 114 [2022-07-19 14:47:04,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:04,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:05,049 INFO L356 Elim1Store]: treesize reduction 45, result has 53.1 percent of original size [2022-07-19 14:47:05,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 258 treesize of output 276 [2022-07-19 14:47:05,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 187 treesize of output 157 [2022-07-19 14:47:05,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 214 treesize of output 202 [2022-07-19 14:47:05,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:05,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 186 [2022-07-19 14:47:05,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:05,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 123 [2022-07-19 14:47:05,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156125899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:47:05,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:47:05,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2022-07-19 14:47:05,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195517516] [2022-07-19 14:47:05,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 14:47:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:47:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 14:47:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=940, Unknown=3, NotChecked=192, Total=1260 [2022-07-19 14:47:05,392 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:47:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:11,498 INFO L93 Difference]: Finished difference Result 195 states and 256 transitions. [2022-07-19 14:47:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 14:47:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-19 14:47:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:11,500 INFO L225 Difference]: With dead ends: 195 [2022-07-19 14:47:11,500 INFO L226 Difference]: Without dead ends: 193 [2022-07-19 14:47:11,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=278, Invalid=1986, Unknown=4, NotChecked=282, Total=2550 [2022-07-19 14:47:11,501 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 75 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:11,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 645 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 402 Invalid, 0 Unknown, 114 Unchecked, 0.5s Time] [2022-07-19 14:47:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-19 14:47:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2022-07-19 14:47:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 151 states have internal predecessors, (196), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 14:47:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2022-07-19 14:47:11,515 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 30 [2022-07-19 14:47:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:11,516 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2022-07-19 14:47:11,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:47:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2022-07-19 14:47:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 14:47:11,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:11,517 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:11,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:47:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 14:47:11,722 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:11,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 701206369, now seen corresponding path program 1 times [2022-07-19 14:47:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:47:11,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200574210] [2022-07-19 14:47:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:47:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:47:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:51,262 WARN L233 SmtUtils]: Spent 16.19s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:48:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:07,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200574210] [2022-07-19 14:48:07,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200574210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:07,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867214527] [2022-07-19 14:48:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:07,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:48:07,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 14:48:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:07,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-19 14:48:07,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:07,543 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:07,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:48:07,608 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:48:07,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:48:07,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:07,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:07,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:07,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-19 14:48:07,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:07,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:48:07,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:48:07,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:48:08,022 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3271 Int) (v_ArrVal_3274 (Array Int Int)) (v_ArrVal_3275 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (v_ArrVal_3278 (Array Int Int)) (v_ArrVal_3279 (Array Int Int)) (|v_append_to_queue_~#p.base_85| Int) (append_to_queue_~node~0.base Int) (v_ArrVal_3272 Int) (v_ArrVal_3282 (Array Int Int)) (v_ArrVal_3273 Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_85| v_ArrVal_3274) append_to_queue_~node~0.base v_ArrVal_3278) |c_append_to_queue_#in~q.base| v_ArrVal_3279) |c_#memory_$Pointer$.base|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_85| v_ArrVal_3277) append_to_queue_~node~0.base v_ArrVal_3282) |c_append_to_queue_#in~q.base| v_ArrVal_3275) |c_#memory_$Pointer$.offset|) (= (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_85| v_ArrVal_3273) append_to_queue_~node~0.base v_ArrVal_3271) |v_append_to_queue_~#p.base_85| v_ArrVal_3272) |c_#valid|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_85|) 0))) is different from true [2022-07-19 14:48:08,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:08,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:08,067 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 14:48:08,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-07-19 14:48:08,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:08,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:08,096 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 14:48:08,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-07-19 14:48:08,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:08,136 INFO L356 Elim1Store]: treesize reduction 58, result has 35.6 percent of original size [2022-07-19 14:48:08,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 46 [2022-07-19 14:48:08,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-19 14:48:08,254 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:48:08,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:48:08,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:08,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:08,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:08,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:48:08,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:48:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:08,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:08,321 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3295) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_3293 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3293) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-07-19 14:48:12,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3328 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (v_ArrVal_3326 Int) (v_ArrVal_3327 Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_29| Int) (v_ArrVal_3288 Int) (v_append_to_queue_~node~0.base_29 Int) (v_ArrVal_3330 (Array Int Int)) (|v_append_to_queue_~#p.base_91| Int) (v_ArrVal_3331 (Array Int Int)) (v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (or (and (forall ((v_ArrVal_3295 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_append_to_queue_~#p.base_91| v_ArrVal_3325) v_append_to_queue_~node~0.base_29 v_ArrVal_3331) |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3324) |v_ULTIMATE.start_receive_~#packet~0#1.base_29| v_ArrVal_3295) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_3293 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_append_to_queue_~#p.base_91| v_ArrVal_3323) v_append_to_queue_~node~0.base_29 v_ArrVal_3329) |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_3330) |v_ULTIMATE.start_receive_~#packet~0#1.base_29| v_ArrVal_3293) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store (store (store |c_#valid| |v_append_to_queue_~#p.base_91| v_ArrVal_3327) v_append_to_queue_~node~0.base_29 v_ArrVal_3328) |v_append_to_queue_~#p.base_91| v_ArrVal_3326) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_3288) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_append_to_queue_~#p.base_91|) 0)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_29|)) (not (< v_append_to_queue_~node~0.base_29 |c_#StackHeapBarrier|)))) is different from false [2022-07-19 14:48:12,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867214527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:12,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:48:12,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2022-07-19 14:48:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41772222] [2022-07-19 14:48:12,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:12,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 14:48:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 14:48:12,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=249, Unknown=7, NotChecked=108, Total=462 [2022-07-19 14:48:12,763 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:48:15,365 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse17 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse17 (select |c_#memory_$Pointer$.base| .cse17))) (.cse30 (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)))) (let ((.cse29 (@diff .cse30 |c_#memory_$Pointer$.offset|)) (.cse7 (@diff .cse8 |c_#memory_$Pointer$.base|))) (let ((.cse9 (store .cse8 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (.cse5 (store .cse30 .cse29 (select |c_#memory_$Pointer$.offset| .cse29)))) (let ((.cse4 (@diff .cse5 |c_#memory_$Pointer$.offset|)) (.cse10 (@diff .cse9 |c_#memory_$Pointer$.base|))) (let ((.cse19 (store .cse9 .cse10 (select |c_#memory_$Pointer$.base| .cse10))) (.cse28 (store .cse5 .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse27 (@diff .cse28 |c_#memory_$Pointer$.offset|)) (.cse18 (@diff .cse19 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse19 .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (.cse26 (store .cse28 .cse27 (select |c_#memory_$Pointer$.offset| .cse27)))) (let ((.cse25 (@diff .cse26 |c_#memory_$Pointer$.offset|)) (.cse24 (@diff |c_old(#valid)| |c_#valid|)) (.cse2 (@diff .cse3 |c_#memory_$Pointer$.base|))) (let ((.cse14 (store .cse3 .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (.cse1 (store |c_old(#valid)| .cse24 (select |c_#valid| .cse24))) (.cse15 (store .cse26 .cse25 (select |c_#memory_$Pointer$.offset| .cse25)))) (let ((.cse16 (@diff .cse15 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#valid|)) (.cse13 (@diff .cse14 |c_#memory_$Pointer$.base|))) (let ((.cse22 (store .cse14 .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse11 (store .cse1 .cse0 (select |c_#valid| .cse0))) (.cse20 (store .cse15 .cse16 (select |c_#memory_$Pointer$.offset| .cse16)))) (let ((.cse21 (@diff .cse20 |c_#memory_$Pointer$.offset|)) (.cse12 (@diff .cse11 |c_#valid|)) (.cse23 (@diff .cse22 |c_#memory_$Pointer$.base|))) (and (or (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse3) (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse5) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse6) 0) (= .cse6 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse7) 0) (= |c_#memory_$Pointer$.base| .cse8) (= .cse7 |c_append_to_queue_#in~q.base|) (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse9) (<= (+ .cse10 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse10) 0) (= .cse10 |c_append_to_queue_#in~q.base|)) (= |c_#valid| (store .cse11 .cse12 (select |c_#valid| .cse12))) (or (= (select |c_old(#valid)| .cse13) 0) (= .cse14 |c_#memory_$Pointer$.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|) (= .cse13 |c_append_to_queue_#in~q.base|)) (or (= .cse15 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse16) 0) (<= (+ .cse16 1) |c_#StackHeapBarrier|) (= .cse16 |c_append_to_queue_#in~q.base|)) (exists ((v_ArrVal_3271 Int) (v_ArrVal_3274 (Array Int Int)) (v_ArrVal_3275 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (v_ArrVal_3278 (Array Int Int)) (v_ArrVal_3279 (Array Int Int)) (|v_append_to_queue_~#p.base_85| Int) (append_to_queue_~node~0.base Int) (v_ArrVal_3272 Int) (v_ArrVal_3282 (Array Int Int)) (v_ArrVal_3273 Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_85| v_ArrVal_3274) append_to_queue_~node~0.base v_ArrVal_3278) |c_append_to_queue_#in~q.base| v_ArrVal_3279) |c_#memory_$Pointer$.base|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_85| v_ArrVal_3277) append_to_queue_~node~0.base v_ArrVal_3282) |c_append_to_queue_#in~q.base| v_ArrVal_3275) |c_#memory_$Pointer$.offset|) (= (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_85| v_ArrVal_3273) append_to_queue_~node~0.base v_ArrVal_3271) |v_append_to_queue_~#p.base_85| v_ArrVal_3272) |c_#valid|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_85|) 0))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse18) 0) (= |c_#memory_$Pointer$.base| .cse19) (= .cse18 |c_append_to_queue_#in~q.base|) (<= (+ .cse18 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse20 .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (or (= (select |c_old(#valid)| .cse21) 0) (= .cse21 |c_append_to_queue_#in~q.base|) (<= (+ .cse21 1) |c_#StackHeapBarrier|) (= .cse20 |c_#memory_$Pointer$.offset|)) (= |c_#memory_$Pointer$.base| (store .cse22 .cse23 (select |c_#memory_$Pointer$.base| .cse23))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse25) 0) (<= (+ .cse25 1) |c_#StackHeapBarrier|) (= .cse26 |c_#memory_$Pointer$.offset|) (= .cse25 |c_append_to_queue_#in~q.base|)) (or (= .cse27 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse28) (= (select |c_old(#valid)| .cse27) 0) (<= (+ .cse27 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse12) 0) (= |c_#valid| .cse11)) (or (= |c_#memory_$Pointer$.base| .cse22) (<= (+ .cse23 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse23) 0) (= |c_append_to_queue_#in~q.base| .cse23)) (or (= .cse29 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse30) (= (select |c_old(#valid)| .cse29) 0) (<= (+ .cse29 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-07-19 14:48:17,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:48:22,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:48:25,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:48:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:27,119 INFO L93 Difference]: Finished difference Result 219 states and 292 transitions. [2022-07-19 14:48:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:48:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-19 14:48:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:27,120 INFO L225 Difference]: With dead ends: 219 [2022-07-19 14:48:27,120 INFO L226 Difference]: Without dead ends: 196 [2022-07-19 14:48:27,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=130, Invalid=340, Unknown=8, NotChecked=172, Total=650 [2022-07-19 14:48:27,121 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:27,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 225 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 198 Invalid, 3 Unknown, 94 Unchecked, 12.2s Time] [2022-07-19 14:48:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-19 14:48:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2022-07-19 14:48:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 162 states have (on average 1.308641975308642) internal successors, (212), 163 states have internal predecessors, (212), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 14:48:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2022-07-19 14:48:27,132 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 30 [2022-07-19 14:48:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:27,133 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2022-07-19 14:48:27,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:48:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2022-07-19 14:48:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:48:27,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:27,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:27,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 14:48:27,339 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash -825884899, now seen corresponding path program 1 times [2022-07-19 14:48:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:27,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315502288] [2022-07-19 14:48:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:48:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 14:48:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315502288] [2022-07-19 14:48:27,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315502288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665161881] [2022-07-19 14:48:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:27,869 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:48:27,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 14:48:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:28,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-19 14:48:28,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:28,152 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:28,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:48:28,192 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:48:28,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:48:28,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:48:28,210 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:48:28,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:48:28,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:48:28,240 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:48:28,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:48:28,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:28,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:48:28,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-19 14:48:28,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-19 14:48:28,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:48:28,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:48:28,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2022-07-19 14:48:28,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2022-07-19 14:48:28,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2022-07-19 14:48:28,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2022-07-19 14:48:29,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,254 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-07-19 14:48:29,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 76 [2022-07-19 14:48:29,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:29,285 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 14:48:29,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 53 [2022-07-19 14:48:29,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-19 14:48:29,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 24 [2022-07-19 14:48:29,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-19 14:48:29,338 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:48:29,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 14:48:29,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 11 [2022-07-19 14:48:29,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 14:48:29,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-07-19 14:48:29,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:48:29,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:48:29,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 14:48:29,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:48:29,454 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:48:29,491 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:48:29,497 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:48:29,501 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:48:29,506 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:48:29,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-19 14:48:31,374 INFO L356 Elim1Store]: treesize reduction 24, result has 82.5 percent of original size [2022-07-19 14:48:31,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 205 treesize of output 248 [2022-07-19 14:48:31,534 INFO L356 Elim1Store]: treesize reduction 38, result has 83.1 percent of original size [2022-07-19 14:48:31,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 255 treesize of output 373 [2022-07-19 14:48:53,899 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3695 (Array Int Int)) (v_ArrVal_3700 (Array Int Int)) (|v_send_~#p.base_7| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_send_~#p.base_7| v_ArrVal_3695) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |v_send_~#p.base_7| v_ArrVal_3700) |c_#memory_$Pointer$.offset|) (< |c_#StackHeapBarrier| |v_send_~#p.base_7|))) is different from true [2022-07-19 14:48:53,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:53,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:54,087 INFO L356 Elim1Store]: treesize reduction 98, result has 54.6 percent of original size [2022-07-19 14:48:54,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 192 treesize of output 271 [2022-07-19 14:48:54,155 INFO L356 Elim1Store]: treesize reduction 86, result has 48.8 percent of original size [2022-07-19 14:48:54,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 328 treesize of output 373 [2022-07-19 14:48:54,161 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:48:54,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:54,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 14:48:54,372 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 14:48:54,376 INFO L158 Benchmark]: Toolchain (without parser) took 183333.90ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 87.9MB in the beginning and 242.3MB in the end (delta: -154.5MB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. [2022-07-19 14:48:54,376 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:48:54,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.77ms. Allocated memory is still 119.5MB. Free memory was 87.9MB in the beginning and 83.8MB in the end (delta: 4.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-19 14:48:54,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.90ms. Allocated memory is still 119.5MB. Free memory was 83.8MB in the beginning and 81.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:48:54,376 INFO L158 Benchmark]: Boogie Preprocessor took 29.71ms. Allocated memory is still 119.5MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:48:54,376 INFO L158 Benchmark]: RCFGBuilder took 398.02ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 79.3MB in the beginning and 117.6MB in the end (delta: -38.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-19 14:48:54,376 INFO L158 Benchmark]: TraceAbstraction took 182455.70ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 117.0MB in the beginning and 242.3MB in the end (delta: -125.3MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2022-07-19 14:48:54,377 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.77ms. Allocated memory is still 119.5MB. Free memory was 87.9MB in the beginning and 83.8MB in the end (delta: 4.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.90ms. Allocated memory is still 119.5MB. Free memory was 83.8MB in the beginning and 81.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.71ms. Allocated memory is still 119.5MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.02ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 79.3MB in the beginning and 117.6MB in the end (delta: -38.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 182455.70ms. Allocated memory was 144.7MB in the beginning and 302.0MB in the end (delta: 157.3MB). Free memory was 117.0MB in the beginning and 242.3MB in the end (delta: -125.3MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:48:54,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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-data/packet_filter.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:48:56,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:48:56,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:48:56,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:48:56,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:48:56,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:48:56,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:48:56,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:48:56,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:48:56,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:48:56,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:48:56,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:48:56,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:48:56,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:48:56,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:48:56,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:48:56,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:48:56,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:48:56,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:48:56,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:48:56,349 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:48:56,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:48:56,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:48:56,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:48:56,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:48:56,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:48:56,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:48:56,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:48:56,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:48:56,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:48:56,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:48:56,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:48:56,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:48:56,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:48:56,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:48:56,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:48:56,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:48:56,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:48:56,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:48:56,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:48:56,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:48:56,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:48:56,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:48:56,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:48:56,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:48:56,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:48:56,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:48:56,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:48:56,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:48:56,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:48:56,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:48:56,406 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:48:56,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:48:56,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:48:56,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:48:56,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:48:56,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:48:56,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:48:56,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:48:56,408 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:48:56,409 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:48:56,409 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:48:56,409 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:48:56,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:48:56,409 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:48:56,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:48:56,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:48:56,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:48:56,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:48:56,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:48:56,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:48:56,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:48:56,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:48:56,411 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:48:56,411 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:48:56,411 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:48:56,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:48:56,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:48:56,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:48:56,412 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2022-07-19 14:48:56,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:48:56,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:48:56,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:48:56,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:48:56,743 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:48:56,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2022-07-19 14:48:56,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e54ce76/2f8ee51cdb9b4b21a56924416bc3acd8/FLAG59a082b9b [2022-07-19 14:48:57,247 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:48:57,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2022-07-19 14:48:57,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e54ce76/2f8ee51cdb9b4b21a56924416bc3acd8/FLAG59a082b9b [2022-07-19 14:48:57,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e54ce76/2f8ee51cdb9b4b21a56924416bc3acd8 [2022-07-19 14:48:57,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:48:57,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:48:57,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:48:57,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:48:57,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:48:57,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442342b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57, skipping insertion in model container [2022-07-19 14:48:57,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:48:57,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:48:57,571 WARN L230 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-data/packet_filter.i[23925,23938] [2022-07-19 14:48:57,581 WARN L230 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-data/packet_filter.i[24159,24172] [2022-07-19 14:48:57,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:48:57,605 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:48:57,659 WARN L230 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-data/packet_filter.i[23925,23938] [2022-07-19 14:48:57,660 WARN L230 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-data/packet_filter.i[24159,24172] [2022-07-19 14:48:57,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:48:57,686 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:48:57,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57 WrapperNode [2022-07-19 14:48:57,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:48:57,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:48:57,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:48:57,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:48:57,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,725 INFO L137 Inliner]: procedures = 134, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-07-19 14:48:57,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:48:57,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:48:57,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:48:57,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:48:57,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:48:57,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:48:57,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:48:57,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:48:57,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (1/1) ... [2022-07-19 14:48:57,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:48:57,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:57,774 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) [2022-07-19 14:48:57,809 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 [2022-07-19 14:48:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:48:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:48:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:48:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2022-07-19 14:48:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2022-07-19 14:48:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:48:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:48:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:48:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2022-07-19 14:48:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure send [2022-07-19 14:48:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2022-07-19 14:48:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:48:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:48:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:48:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:48:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-19 14:48:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:48:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:48:57,906 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:48:57,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:49:00,365 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:49:00,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:49:00,369 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 14:49:00,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:49:00 BoogieIcfgContainer [2022-07-19 14:49:00,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:49:00,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:49:00,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:49:00,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:49:00,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:48:57" (1/3) ... [2022-07-19 14:49:00,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30aa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:49:00, skipping insertion in model container [2022-07-19 14:49:00,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:57" (2/3) ... [2022-07-19 14:49:00,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30aa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:49:00, skipping insertion in model container [2022-07-19 14:49:00,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:49:00" (3/3) ... [2022-07-19 14:49:00,385 INFO L111 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2022-07-19 14:49:00,395 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:49:00,396 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 14:49:00,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:49:00,461 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57060d6e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5980892c [2022-07-19 14:49:00,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 14:49:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 38 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 14:49:00,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:00,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:00,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1939589719, now seen corresponding path program 1 times [2022-07-19 14:49:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:00,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141380403] [2022-07-19 14:49:00,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:00,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:00,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:00,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:00,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:49:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:00,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:49:00,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:00,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:49:00,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:00,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141380403] [2022-07-19 14:49:00,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141380403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:49:00,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:49:00,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:49:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539410452] [2022-07-19 14:49:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:49:00,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:49:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:00,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:49:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:49:00,658 INFO L87 Difference]: Start difference. First operand has 46 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 38 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:00,677 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-07-19 14:49:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:49:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 14:49:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:00,683 INFO L225 Difference]: With dead ends: 73 [2022-07-19 14:49:00,683 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 14:49:00,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:49:00,689 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:49:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 14:49:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-19 14:49:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-07-19 14:49:00,734 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 8 [2022-07-19 14:49:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:00,735 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-07-19 14:49:00,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-07-19 14:49:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 14:49:00,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:00,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:00,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:00,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1296098990, now seen corresponding path program 1 times [2022-07-19 14:49:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120975012] [2022-07-19 14:49:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:00,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:00,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:49:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:01,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:49:01,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:01,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:01,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:01,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:49:01,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120975012] [2022-07-19 14:49:01,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120975012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:49:01,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:49:01,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:49:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842076292] [2022-07-19 14:49:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:49:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:49:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:49:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:49:01,167 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:02,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:02,348 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-07-19 14:49:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:49:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 14:49:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:02,351 INFO L225 Difference]: With dead ends: 75 [2022-07-19 14:49:02,351 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 14:49:02,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:49:02,352 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:02,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 14:49:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 14:49:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-07-19 14:49:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-07-19 14:49:02,367 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 8 [2022-07-19 14:49:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:02,367 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-07-19 14:49:02,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-07-19 14:49:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:49:02,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:02,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:02,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:02,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:02,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -27492729, now seen corresponding path program 1 times [2022-07-19 14:49:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:02,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2492830] [2022-07-19 14:49:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:02,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:02,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:02,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:49:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:02,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:49:02,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:02,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:02,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:02,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:49:02,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:02,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2492830] [2022-07-19 14:49:02,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2492830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:49:02,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:49:02,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:49:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269437241] [2022-07-19 14:49:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:49:02,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:49:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:49:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:49:02,795 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:03,602 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-07-19 14:49:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:49:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-19 14:49:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:03,604 INFO L225 Difference]: With dead ends: 59 [2022-07-19 14:49:03,604 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 14:49:03,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:49:03,605 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:03,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 14:49:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 14:49:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-19 14:49:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-07-19 14:49:03,610 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 10 [2022-07-19 14:49:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:03,610 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-07-19 14:49:03,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-07-19 14:49:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:49:03,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:03,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:03,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:03,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:03,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:03,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -817522987, now seen corresponding path program 1 times [2022-07-19 14:49:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:03,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859123863] [2022-07-19 14:49:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:03,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:03,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:03,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:03,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:49:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:03,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:49:03,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:49:03,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:49:03,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859123863] [2022-07-19 14:49:03,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859123863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:49:03,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:49:03,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:49:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863782744] [2022-07-19 14:49:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:49:03,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:49:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:49:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:49:03,938 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:03,950 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-07-19 14:49:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:49:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-19 14:49:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:03,952 INFO L225 Difference]: With dead ends: 46 [2022-07-19 14:49:03,952 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 14:49:03,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:49:03,953 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:03,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:49:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 14:49:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-19 14:49:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-07-19 14:49:03,957 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 14 [2022-07-19 14:49:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:03,957 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-07-19 14:49:03,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-07-19 14:49:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:49:03,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:03,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:03,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:04,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:04,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -817521065, now seen corresponding path program 1 times [2022-07-19 14:49:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:04,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114990477] [2022-07-19 14:49:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:04,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:04,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:49:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:04,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 14:49:04,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:04,286 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:49:04,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-19 14:49:04,327 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:49:04,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:49:04,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:04,364 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:49:04,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:49:04,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:04,397 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:49:04,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-19 14:49:04,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:04,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:04,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:04,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:04,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:04,592 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_82 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_82) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_80 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_80) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)))) is different from false [2022-07-19 14:49:04,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_11| (_ BitVec 32))) (or (not (= (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_11| (_ bv1 1)) |v_ULTIMATE.start_receive_~#packet~0#1.base_6|)) (_ bv0 1))) (and (forall ((v_ArrVal_82 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_6| v_ArrVal_82) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (forall ((v_ArrVal_80 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_6| v_ArrVal_80) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-19 14:49:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 14:49:04,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:04,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114990477] [2022-07-19 14:49:04,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114990477] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:49:04,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:49:04,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-19 14:49:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706232073] [2022-07-19 14:49:04,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:49:04,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:49:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:49:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2022-07-19 14:49:04,680 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:06,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:06,248 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-07-19 14:49:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:49:06,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-19 14:49:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:06,249 INFO L225 Difference]: With dead ends: 89 [2022-07-19 14:49:06,249 INFO L226 Difference]: Without dead ends: 66 [2022-07-19 14:49:06,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2022-07-19 14:49:06,250 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:06,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 90 Unchecked, 1.5s Time] [2022-07-19 14:49:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-19 14:49:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-07-19 14:49:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-07-19 14:49:06,261 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 14 [2022-07-19 14:49:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:06,261 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-07-19 14:49:06,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-07-19 14:49:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:49:06,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:06,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:06,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 14:49:06,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:06,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 301318382, now seen corresponding path program 1 times [2022-07-19 14:49:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:06,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614835195] [2022-07-19 14:49:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:06,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:06,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:06,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:06,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:49:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:06,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 14:49:06,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:06,595 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-19 14:49:06,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-19 14:49:06,626 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:49:06,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-07-19 14:49:06,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:06,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:06,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:06,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:06,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:06,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:06,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:06,791 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_118) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_119) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-19 14:49:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:06,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:06,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614835195] [2022-07-19 14:49:06,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614835195] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:49:06,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:49:06,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-19 14:49:06,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357275439] [2022-07-19 14:49:06,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:49:06,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:49:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:06,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:49:06,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=28, Unknown=2, NotChecked=10, Total=56 [2022-07-19 14:49:06,880 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:08,080 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-07-19 14:49:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:49:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 14:49:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:08,081 INFO L225 Difference]: With dead ends: 71 [2022-07-19 14:49:08,081 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 14:49:08,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=38, Unknown=2, NotChecked=12, Total=72 [2022-07-19 14:49:08,082 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:08,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 204 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 69 Unchecked, 1.2s Time] [2022-07-19 14:49:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 14:49:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-07-19 14:49:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-07-19 14:49:08,090 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 16 [2022-07-19 14:49:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:08,090 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-07-19 14:49:08,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:49:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-07-19 14:49:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:49:08,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:08,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:08,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:08,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -987183320, now seen corresponding path program 1 times [2022-07-19 14:49:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327356583] [2022-07-19 14:49:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:08,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:08,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:08,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:08,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:49:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:08,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:49:08,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:08,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:08,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-19 14:49:08,534 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:49:08,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 10 [2022-07-19 14:49:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:08,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:49:08,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327356583] [2022-07-19 14:49:08,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327356583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:49:08,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:49:08,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:49:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156365379] [2022-07-19 14:49:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:49:08,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:49:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:49:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:49:08,552 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:49:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:08,606 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2022-07-19 14:49:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:49:08,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:49:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:08,607 INFO L225 Difference]: With dead ends: 100 [2022-07-19 14:49:08,607 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 14:49:08,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:49:08,608 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:08,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 208 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-07-19 14:49:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 14:49:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2022-07-19 14:49:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 49 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:49:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-07-19 14:49:08,612 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 20 [2022-07-19 14:49:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:08,612 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-07-19 14:49:08,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:49:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-07-19 14:49:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:49:08,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:08,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:08,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:08,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:08,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1719436074, now seen corresponding path program 1 times [2022-07-19 14:49:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094613656] [2022-07-19 14:49:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:08,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:08,825 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:08,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:49:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:09,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 14:49:09,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:09,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 14:49:09,247 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:49:09,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:49:09,338 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:49:09,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 [2022-07-19 14:49:09,413 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:49:09,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 [2022-07-19 14:49:09,500 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-19 14:49:09,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-07-19 14:49:09,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:09,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:09,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-19 14:49:09,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-07-19 14:49:09,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:09,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:09,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:09,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:09,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-19 14:49:09,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:10,019 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-19 14:49:10,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 85 [2022-07-19 14:49:10,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 18 [2022-07-19 14:49:10,544 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:49:10,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 85 [2022-07-19 14:49:10,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 58 [2022-07-19 14:49:10,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:10,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:10,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-19 14:49:10,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:10,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-19 14:49:10,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 18 [2022-07-19 14:49:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:10,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:13,353 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:49:13,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 77 [2022-07-19 14:49:13,389 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:49:13,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 44 [2022-07-19 14:49:13,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:49:13,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:13,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094613656] [2022-07-19 14:49:13,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094613656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:49:13,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1740985210] [2022-07-19 14:49:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:49:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:49:13,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:49:13,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-19 14:49:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:13,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 14:49:13,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:13,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 14:49:14,068 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-19 14:49:14,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-19 14:49:14,158 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:49:14,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:49:14,249 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:49:14,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:49:14,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:14,368 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-19 14:49:14,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2022-07-19 14:49:14,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:14,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:49:14,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:14,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:14,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:14,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:14,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-19 14:49:14,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:14,754 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-19 14:49:14,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 79 [2022-07-19 14:49:14,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:49:15,462 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:49:15,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 79 [2022-07-19 14:49:15,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:15,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:15,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-19 14:49:15,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 35 [2022-07-19 14:49:15,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-19 14:49:15,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:49:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:15,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:19,521 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-19 14:49:19,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 77 [2022-07-19 14:49:19,536 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:49:19,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 44 [2022-07-19 14:49:19,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:49:19,730 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-19 14:49:19,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 1 [2022-07-19 14:49:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1740985210] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:49:19,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:49:19,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2022-07-19 14:49:19,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851339023] [2022-07-19 14:49:19,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:49:19,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 14:49:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:19,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 14:49:19,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=508, Unknown=3, NotChecked=0, Total=600 [2022-07-19 14:49:19,877 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:49:22,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:24,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:26,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:27,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:29,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:31,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:32,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:34,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:35,951 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2022-07-19 14:49:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:49:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-07-19 14:49:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:35,954 INFO L225 Difference]: With dead ends: 142 [2022-07-19 14:49:35,954 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 14:49:35,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=143, Invalid=842, Unknown=7, NotChecked=0, Total=992 [2022-07-19 14:49:35,956 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 19 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:35,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 471 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 232 Invalid, 4 Unknown, 92 Unchecked, 15.4s Time] [2022-07-19 14:49:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 14:49:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2022-07-19 14:49:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.328125) internal successors, (85), 65 states have internal predecessors, (85), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:49:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-07-19 14:49:35,973 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 20 [2022-07-19 14:49:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:35,973 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-07-19 14:49:35,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:49:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-07-19 14:49:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 14:49:35,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:35,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:35,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-19 14:49:36,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-07-19 14:49:36,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-19 14:49:36,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2057977750, now seen corresponding path program 1 times [2022-07-19 14:49:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:36,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999847651] [2022-07-19 14:49:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:36,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:36,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:36,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 14:49:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 14:49:36,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:36,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:36,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:36,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:36,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:36,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:37,588 INFO L356 Elim1Store]: treesize reduction 385, result has 22.8 percent of original size [2022-07-19 14:49:37,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 154 [2022-07-19 14:49:37,731 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:49:37,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:49:37,818 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-19 14:49:37,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-19 14:49:37,919 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-19 14:49:37,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 144 [2022-07-19 14:49:37,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:37,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 14:49:37,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:49:38,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 14:49:38,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 3 [2022-07-19 14:49:38,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:38,400 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:49:38,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2022-07-19 14:49:38,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 32 [2022-07-19 14:49:38,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-07-19 14:49:38,462 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-19 14:49:38,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 92 [2022-07-19 14:49:38,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2022-07-19 14:49:38,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-19 14:49:38,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 14:49:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:38,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:41,238 INFO L356 Elim1Store]: treesize reduction 578, result has 23.4 percent of original size [2022-07-19 14:49:41,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 187 [2022-07-19 14:49:41,314 INFO L356 Elim1Store]: treesize reduction 11, result has 67.6 percent of original size [2022-07-19 14:49:41,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 170 [2022-07-19 14:49:41,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-19 14:49:41,634 INFO L356 Elim1Store]: treesize reduction 754, result has 0.1 percent of original size [2022-07-19 14:49:41,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 1 [2022-07-19 14:49:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:41,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999847651] [2022-07-19 14:49:41,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999847651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:49:41,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:49:41,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-07-19 14:49:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860084893] [2022-07-19 14:49:41,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:49:41,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:49:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:49:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:49:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-19 14:49:41,741 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:49:43,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:45,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:47,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:49,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:51,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:53,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:49:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:54,014 INFO L93 Difference]: Finished difference Result 129 states and 169 transitions. [2022-07-19 14:49:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:49:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-07-19 14:49:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:54,015 INFO L225 Difference]: With dead ends: 129 [2022-07-19 14:49:54,015 INFO L226 Difference]: Without dead ends: 127 [2022-07-19 14:49:54,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-07-19 14:49:54,016 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 105 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:54,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 431 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 200 Invalid, 3 Unknown, 97 Unchecked, 12.1s Time] [2022-07-19 14:49:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-19 14:49:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2022-07-19 14:49:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 73 states have internal predecessors, (97), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 14:49:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2022-07-19 14:49:54,022 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 21 [2022-07-19 14:49:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:54,022 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2022-07-19 14:49:54,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:49:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2022-07-19 14:49:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 14:49:54,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:54,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:49:54,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:54,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:49:54,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 382908074, now seen corresponding path program 1 times [2022-07-19 14:49:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:49:54,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382679528] [2022-07-19 14:49:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:54,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:49:54,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:49:54,225 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:49:54,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 14:49:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:54,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-19 14:49:54,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:54,481 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:49:54,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-19 14:49:54,580 INFO L356 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2022-07-19 14:49:54,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 65 [2022-07-19 14:49:54,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:54,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:54,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:54,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2022-07-19 14:49:54,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:55,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:49:55,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-19 14:49:55,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:49:55,114 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-07-19 14:49:55,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 65 [2022-07-19 14:49:55,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2022-07-19 14:49:55,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,433 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 14:49:55,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 62 [2022-07-19 14:49:55,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:55,590 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 14:49:55,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2022-07-19 14:49:55,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 26 [2022-07-19 14:49:57,338 INFO L356 Elim1Store]: treesize reduction 73, result has 13.1 percent of original size [2022-07-19 14:49:57,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 43 [2022-07-19 14:49:57,414 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-19 14:49:57,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 32 [2022-07-19 14:49:57,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:57,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:49:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:49:57,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:58,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:58,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:49:58,824 INFO L356 Elim1Store]: treesize reduction 35, result has 50.0 percent of original size [2022-07-19 14:49:58,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 82 [2022-07-19 14:49:59,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:49:59,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382679528] [2022-07-19 14:49:59,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382679528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:49:59,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [73572431] [2022-07-19 14:49:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:59,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:49:59,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:49:59,222 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:49:59,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-19 14:49:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:59,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 14:49:59,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:59,623 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:49:59,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-19 14:49:59,698 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:49:59,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:49:59,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:49:59,741 INFO L356 Elim1Store]: treesize reduction 43, result has 31.7 percent of original size [2022-07-19 14:49:59,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2022-07-19 14:49:59,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:59,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:49:59,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 14:49:59,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:50:00,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:50:00,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:50:00,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:50:00,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:00,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:00,325 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 14:50:00,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-07-19 14:50:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:00,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:00,391 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-19 14:50:00,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-07-19 14:50:00,417 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:50:00,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 14:50:00,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:50:00,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:50:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:50:00,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:00,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [73572431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:00,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:50:00,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-07-19 14:50:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681615499] [2022-07-19 14:50:00,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:00,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:50:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:50:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:50:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=158, Unknown=4, NotChecked=0, Total=210 [2022-07-19 14:50:00,827 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:50:03,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:50:04,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:50:05,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:50:07,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:50:09,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:50:10,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 14:50:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:10,978 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2022-07-19 14:50:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:50:10,979 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-07-19 14:50:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:10,980 INFO L225 Difference]: With dead ends: 118 [2022-07-19 14:50:10,980 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 14:50:10,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=257, Unknown=4, NotChecked=0, Total=342 [2022-07-19 14:50:10,981 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-19 14:50:10,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 355 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 2 Unknown, 106 Unchecked, 9.9s Time] [2022-07-19 14:50:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 14:50:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-19 14:50:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 83 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 14:50:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2022-07-19 14:50:10,986 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 21 [2022-07-19 14:50:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:10,986 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2022-07-19 14:50:10,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:50:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2022-07-19 14:50:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:50:10,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:10,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:50:10,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2022-07-19 14:50:11,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-19 14:50:11,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:50:11,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 370758974, now seen corresponding path program 2 times [2022-07-19 14:50:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:50:11,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565648637] [2022-07-19 14:50:11,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:50:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:50:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:50:11,403 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:50:11,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 14:50:11,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:50:11,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:50:11,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 14:50:11,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:11,651 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:50:11,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-19 14:50:11,690 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:50:11,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:50:11,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:50:11,732 INFO L356 Elim1Store]: treesize reduction 55, result has 30.4 percent of original size [2022-07-19 14:50:11,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 46 [2022-07-19 14:50:11,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:50:11,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:50:11,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:50:11,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2022-07-19 14:50:11,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-19 14:50:11,963 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:50:11,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:50:11,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:50:12,043 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:50:12,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:50:12,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:50:12,064 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:50:12,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-19 14:50:12,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:50:12,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:50:12,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:50:12,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:50:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:50:12,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:12,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (forall ((v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1073) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)))) is different from false [2022-07-19 14:50:12,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_20| (_ BitVec 32)) (|v_ULTIMATE.start_receive_~#packet~0#1.base_16| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_16| v_ArrVal_1073) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (forall ((v_ArrVal_1075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_16| v_ArrVal_1075) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1067) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_receive_~#packet~0#1.base_16|)))))) is different from false [2022-07-19 14:50:12,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (_ BitVec 1)) (v_ArrVal_1067 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_20| (_ BitVec 32)) (v_ArrVal_1065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1066 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_receive_~#packet~0#1.base_16| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1065) |v_ULTIMATE.start_receive_~#packet~0#1.base_16| v_ArrVal_1075) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (forall ((v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1066) |v_ULTIMATE.start_receive_~#packet~0#1.base_16| v_ArrVal_1073) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) (_ bv0 32)))) (not (= (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1067) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_receive_~#packet~0#1.base_16|)) (_ bv0 1))))) is different from false [2022-07-19 14:50:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-19 14:50:12,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:50:12,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565648637] [2022-07-19 14:50:12,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565648637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:12,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:50:12,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-07-19 14:50:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491781781] [2022-07-19 14:50:12,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:12,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:50:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:50:12,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:50:12,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=58, Unknown=7, NotChecked=54, Total=156 [2022-07-19 14:50:12,733 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:50:14,798 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_147 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_147)))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| |c_ULTIMATE.start_main_~#new_packet~0#1.base|)) (forall ((v_ArrVal_1067 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_20| (_ BitVec 32)) (|v_ULTIMATE.start_receive_~#packet~0#1.base_16| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_16| v_ArrVal_1073) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|))) (forall ((v_ArrVal_1075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_16| v_ArrVal_1075) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1067) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_receive_~#packet~0#1.base_16|))))))) is different from false [2022-07-19 14:50:15,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []