./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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/uthash-2.0.2/uthash_OAT_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 01:36:23,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 01:36:23,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 01:36:23,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 01:36:23,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 01:36:23,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 01:36:23,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 01:36:23,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 01:36:23,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 01:36:23,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 01:36:23,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 01:36:23,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 01:36:23,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 01:36:23,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 01:36:23,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 01:36:23,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 01:36:23,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 01:36:23,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 01:36:23,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 01:36:23,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 01:36:23,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 01:36:23,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 01:36:23,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 01:36:23,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 01:36:23,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 01:36:23,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 01:36:23,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 01:36:23,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 01:36:23,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 01:36:23,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 01:36:23,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 01:36:23,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 01:36:23,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 01:36:23,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 01:36:23,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 01:36:23,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 01:36:23,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 01:36:23,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 01:36:23,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 01:36:23,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 01:36:23,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 01:36:23,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-06 01:36:23,754 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 01:36:23,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 01:36:23,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 01:36:23,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 01:36:23,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 01:36:23,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 01:36:23,757 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 01:36:23,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 01:36:23,757 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 01:36:23,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 01:36:23,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 01:36:23,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 01:36:23,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 01:36:23,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 01:36:23,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 01:36:23,759 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 01:36:23,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 01:36:23,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 01:36:23,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 01:36:23,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 01:36:23,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 01:36:23,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 01:36:23,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 01:36:23,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 01:36:23,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 01:36:23,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 01:36:23,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 01:36:23,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 01:36:23,766 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 01:36:23,766 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 01:36:23,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 01:36:23,767 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 01:36:23,767 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 -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2021-11-06 01:36:24,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 01:36:24,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 01:36:24,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 01:36:24,017 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 01:36:24,017 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 01:36:24,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2021-11-06 01:36:24,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9153c514/234fc130ee2e4e18981fb981764f3d95/FLAGec9220797 [2021-11-06 01:36:24,510 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 01:36:24,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2021-11-06 01:36:24,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9153c514/234fc130ee2e4e18981fb981764f3d95/FLAGec9220797 [2021-11-06 01:36:24,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9153c514/234fc130ee2e4e18981fb981764f3d95 [2021-11-06 01:36:24,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 01:36:24,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 01:36:24,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 01:36:24,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 01:36:24,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 01:36:24,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:36:24" (1/1) ... [2021-11-06 01:36:24,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7406935d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:24, skipping insertion in model container [2021-11-06 01:36:24,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:36:24" (1/1) ... [2021-11-06 01:36:24,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 01:36:24,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 01:36:24,904 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[33021,33034] [2021-11-06 01:36:24,988 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44124,44137] [2021-11-06 01:36:24,989 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44245,44258] [2021-11-06 01:36:25,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 01:36:25,014 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 01:36:25,043 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[33021,33034] [2021-11-06 01:36:25,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44124,44137] [2021-11-06 01:36:25,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44245,44258] [2021-11-06 01:36:25,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 01:36:25,141 INFO L208 MainTranslator]: Completed translation [2021-11-06 01:36:25,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25 WrapperNode [2021-11-06 01:36:25,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 01:36:25,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 01:36:25,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 01:36:25,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 01:36:25,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 01:36:25,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 01:36:25,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 01:36:25,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 01:36:25,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 01:36:25,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 01:36:25,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 01:36:25,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 01:36:25,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (1/1) ... [2021-11-06 01:36:25,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 01:36:25,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:25,341 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) [2021-11-06 01:36:25,373 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 [2021-11-06 01:36:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 01:36:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 01:36:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 01:36:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 01:36:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 01:36:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 01:36:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 01:36:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 01:36:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 01:36:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 01:36:25,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 01:36:26,360 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 01:36:26,361 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-06 01:36:26,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:36:26 BoogieIcfgContainer [2021-11-06 01:36:26,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 01:36:26,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 01:36:26,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 01:36:26,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 01:36:26,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:36:24" (1/3) ... [2021-11-06 01:36:26,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c69ff03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:36:26, skipping insertion in model container [2021-11-06 01:36:26,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:25" (2/3) ... [2021-11-06 01:36:26,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c69ff03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:36:26, skipping insertion in model container [2021-11-06 01:36:26,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:36:26" (3/3) ... [2021-11-06 01:36:26,367 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-2.i [2021-11-06 01:36:26,371 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 01:36:26,371 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 01:36:26,406 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 01:36:26,411 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 01:36:26,411 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 01:36:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 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) [2021-11-06 01:36:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 01:36:26,430 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:26,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:26,430 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 01:36:26,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:26,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937272949] [2021-11-06 01:36:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:26,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:26,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:26,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937272949] [2021-11-06 01:36:26,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937272949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:26,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:26,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 01:36:26,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562491221] [2021-11-06 01:36:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:26,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 01:36:26,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 01:36:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 01:36:26,579 INFO L87 Difference]: Start difference. First operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 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) [2021-11-06 01:36:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:26,625 INFO L93 Difference]: Finished difference Result 419 states and 707 transitions. [2021-11-06 01:36:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 01:36:26,627 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 [2021-11-06 01:36:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:26,635 INFO L225 Difference]: With dead ends: 419 [2021-11-06 01:36:26,635 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 01:36:26,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 01:36:26,641 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.03ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:26,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 4.03ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 01:36:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 01:36:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 01:36:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 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) [2021-11-06 01:36:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 01:36:26,682 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 01:36:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:26,682 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 01:36:26,682 INFO L471 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) [2021-11-06 01:36:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 01:36:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 01:36:26,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:26,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:26,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 01:36:26,684 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 01:36:26,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:26,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092847454] [2021-11-06 01:36:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:26,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:26,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:26,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092847454] [2021-11-06 01:36:26,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092847454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:26,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:26,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 01:36:26,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040572025] [2021-11-06 01:36:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:26,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:36:26,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:36:26,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:26,778 INFO L87 Difference]: Start difference. First operand 177 states and 232 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) [2021-11-06 01:36:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:27,032 INFO L93 Difference]: Finished difference Result 382 states and 501 transitions. [2021-11-06 01:36:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:27,032 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 [2021-11-06 01:36:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:27,034 INFO L225 Difference]: With dead ends: 382 [2021-11-06 01:36:27,034 INFO L226 Difference]: Without dead ends: 295 [2021-11-06 01:36:27,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.26ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:27,035 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 184.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.56ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 227.55ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:27,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 564 Invalid, 158 Unknown, 0 Unchecked, 3.56ms Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 227.55ms Time] [2021-11-06 01:36:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-06 01:36:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-11-06 01:36:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 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) [2021-11-06 01:36:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 01:36:27,044 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 01:36:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:27,044 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 01:36:27,045 INFO L471 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) [2021-11-06 01:36:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 01:36:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 01:36:27,046 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:27,046 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:27,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 01:36:27,047 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 01:36:27,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:27,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985427651] [2021-11-06 01:36:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:27,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:27,064 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:27,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136516282] [2021-11-06 01:36:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:27,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:27,073 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) [2021-11-06 01:36:27,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 01:36:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:27,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:27,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:27,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:27,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:27,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985427651] [2021-11-06 01:36:27,408 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:27,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136516282] [2021-11-06 01:36:27,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136516282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:27,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:27,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 01:36:27,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137420197] [2021-11-06 01:36:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:27,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 01:36:27,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 01:36:27,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:27,411 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-11-06 01:36:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:27,458 INFO L93 Difference]: Finished difference Result 375 states and 495 transitions. [2021-11-06 01:36:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 01:36:27,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-06 01:36:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:27,460 INFO L225 Difference]: With dead ends: 375 [2021-11-06 01:36:27,460 INFO L226 Difference]: Without dead ends: 200 [2021-11-06 01:36:27,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.89ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:27,461 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.72ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.58ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:27,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 409 Invalid, 72 Unknown, 0 Unchecked, 0.72ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 42.58ms Time] [2021-11-06 01:36:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-06 01:36:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-11-06 01:36:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 1.2893401015228427) internal successors, (254), 198 states have internal predecessors, (254), 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) [2021-11-06 01:36:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 254 transitions. [2021-11-06 01:36:27,467 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 254 transitions. Word has length 62 [2021-11-06 01:36:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:27,468 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 254 transitions. [2021-11-06 01:36:27,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-11-06 01:36:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 254 transitions. [2021-11-06 01:36:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 01:36:27,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:27,470 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:27,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:27,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:27,689 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1305568807, now seen corresponding path program 1 times [2021-11-06 01:36:27,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:27,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846849137] [2021-11-06 01:36:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:27,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:27,709 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:27,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700317722] [2021-11-06 01:36:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:27,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:27,714 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) [2021-11-06 01:36:27,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 01:36:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:27,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:27,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:27,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:27,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:27,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846849137] [2021-11-06 01:36:27,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:27,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700317722] [2021-11-06 01:36:27,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700317722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:27,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:27,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 01:36:27,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439180335] [2021-11-06 01:36:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:27,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:36:27,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:27,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:36:27,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:27,976 INFO L87 Difference]: Start difference. First operand 199 states and 254 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2021-11-06 01:36:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:28,032 INFO L93 Difference]: Finished difference Result 386 states and 496 transitions. [2021-11-06 01:36:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:28,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2021-11-06 01:36:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:28,033 INFO L225 Difference]: With dead ends: 386 [2021-11-06 01:36:28,034 INFO L226 Difference]: Without dead ends: 191 [2021-11-06 01:36:28,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.34ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:28,035 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 220 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.27ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:28,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 420 Invalid, 66 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 44.27ms Time] [2021-11-06 01:36:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-06 01:36:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2021-11-06 01:36:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 1.273224043715847) internal successors, (233), 184 states have internal predecessors, (233), 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) [2021-11-06 01:36:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-11-06 01:36:28,043 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 62 [2021-11-06 01:36:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:28,043 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-11-06 01:36:28,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2021-11-06 01:36:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-11-06 01:36:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 01:36:28,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:28,044 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:28,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:28,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-06 01:36:28,259 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 01:36:28,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:28,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477869701] [2021-11-06 01:36:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:28,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:28,272 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:28,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432917089] [2021-11-06 01:36:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:28,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:28,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:28,274 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) [2021-11-06 01:36:28,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 01:36:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:28,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 01:36:28,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:28,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:28,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:28,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477869701] [2021-11-06 01:36:28,620 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:28,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432917089] [2021-11-06 01:36:28,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432917089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:28,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:28,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 01:36:28,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727914661] [2021-11-06 01:36:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:28,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 01:36:28,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 01:36:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:28,623 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-11-06 01:36:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:28,683 INFO L93 Difference]: Finished difference Result 479 states and 602 transitions. [2021-11-06 01:36:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 01:36:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-06 01:36:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:28,686 INFO L225 Difference]: With dead ends: 479 [2021-11-06 01:36:28,686 INFO L226 Difference]: Without dead ends: 298 [2021-11-06 01:36:28,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.73ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:28,687 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 105 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.60ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:28,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 463 Invalid, 32 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 53.60ms Time] [2021-11-06 01:36:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-06 01:36:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2021-11-06 01:36:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 289 states have (on average 1.2664359861591696) internal successors, (366), 290 states have internal predecessors, (366), 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) [2021-11-06 01:36:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 366 transitions. [2021-11-06 01:36:28,693 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 366 transitions. Word has length 62 [2021-11-06 01:36:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:28,694 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 366 transitions. [2021-11-06 01:36:28,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-11-06 01:36:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 366 transitions. [2021-11-06 01:36:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 01:36:28,695 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:28,695 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:28,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:28,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:28,907 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 01:36:28,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:28,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751486691] [2021-11-06 01:36:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:28,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:28,918 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:28,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416901854] [2021-11-06 01:36:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:28,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:28,919 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) [2021-11-06 01:36:28,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 01:36:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:29,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:29,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:29,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 01:36:29,175 INFO L388 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 [2021-11-06 01:36:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 01:36:29,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:29,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:29,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751486691] [2021-11-06 01:36:29,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:29,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416901854] [2021-11-06 01:36:29,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416901854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:29,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:29,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 01:36:29,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270058051] [2021-11-06 01:36:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:29,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:36:29,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:29,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:36:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:29,186 INFO L87 Difference]: Start difference. First operand 291 states and 366 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 01:36:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:29,454 INFO L93 Difference]: Finished difference Result 379 states and 483 transitions. [2021-11-06 01:36:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:29,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-06 01:36:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:29,456 INFO L225 Difference]: With dead ends: 379 [2021-11-06 01:36:29,456 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 01:36:29,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.54ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:29,456 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 135 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 205.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 254.64ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:29,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 564 Invalid, 137 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 254.64ms Time] [2021-11-06 01:36:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 01:36:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 293. [2021-11-06 01:36:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 292 states have internal predecessors, (368), 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) [2021-11-06 01:36:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2021-11-06 01:36:29,462 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 69 [2021-11-06 01:36:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:29,462 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2021-11-06 01:36:29,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 01:36:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2021-11-06 01:36:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 01:36:29,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:29,463 INFO L514 BasicCegarLoop]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:29,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:29,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:29,675 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-06 01:36:29,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:29,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037176113] [2021-11-06 01:36:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:29,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:29,685 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:29,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040736710] [2021-11-06 01:36:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:29,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:29,687 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) [2021-11-06 01:36:29,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 01:36:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:29,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:29,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 01:36:29,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:29,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:29,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037176113] [2021-11-06 01:36:29,937 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:29,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040736710] [2021-11-06 01:36:29,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040736710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:29,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:29,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 01:36:29,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16650345] [2021-11-06 01:36:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:29,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 01:36:29,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:29,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 01:36:29,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:29,943 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2021-11-06 01:36:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:29,984 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2021-11-06 01:36:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 01:36:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 103 [2021-11-06 01:36:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:29,986 INFO L225 Difference]: With dead ends: 483 [2021-11-06 01:36:29,986 INFO L226 Difference]: Without dead ends: 335 [2021-11-06 01:36:29,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:29,988 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.68ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.15ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:29,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 395 Invalid, 72 Unknown, 0 Unchecked, 0.68ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 35.15ms Time] [2021-11-06 01:36:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-06 01:36:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2021-11-06 01:36:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 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) [2021-11-06 01:36:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2021-11-06 01:36:29,998 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 103 [2021-11-06 01:36:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:29,999 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2021-11-06 01:36:30,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2021-11-06 01:36:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2021-11-06 01:36:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 01:36:30,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:30,004 INFO L514 BasicCegarLoop]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:30,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:30,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:30,222 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-06 01:36:30,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:30,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499912156] [2021-11-06 01:36:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:30,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:30,232 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:30,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841647350] [2021-11-06 01:36:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:30,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:30,239 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) [2021-11-06 01:36:30,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 01:36:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:30,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:30,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 01:36:30,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:30,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:30,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499912156] [2021-11-06 01:36:30,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:30,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841647350] [2021-11-06 01:36:30,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841647350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:30,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:30,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 01:36:30,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186221050] [2021-11-06 01:36:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:30,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:36:30,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:36:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:30,491 INFO L87 Difference]: Start difference. First operand 333 states and 408 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) [2021-11-06 01:36:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:30,535 INFO L93 Difference]: Finished difference Result 498 states and 622 transitions. [2021-11-06 01:36:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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 103 [2021-11-06 01:36:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:30,537 INFO L225 Difference]: With dead ends: 498 [2021-11-06 01:36:30,537 INFO L226 Difference]: Without dead ends: 310 [2021-11-06 01:36:30,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:30,538 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 103 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.73ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:30,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 510 Invalid, 66 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 33.73ms Time] [2021-11-06 01:36:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-06 01:36:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2021-11-06 01:36:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 303 states have (on average 1.2079207920792079) internal successors, (366), 304 states have internal predecessors, (366), 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) [2021-11-06 01:36:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2021-11-06 01:36:30,544 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 103 [2021-11-06 01:36:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:30,544 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2021-11-06 01:36:30,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) [2021-11-06 01:36:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2021-11-06 01:36:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 01:36:30,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:30,545 INFO L514 BasicCegarLoop]: 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:30,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:30,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:30,759 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-06 01:36:30,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:30,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757375652] [2021-11-06 01:36:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:30,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:30,769 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:30,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793002999] [2021-11-06 01:36:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:30,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:30,770 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) [2021-11-06 01:36:30,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 01:36:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:30,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 01:36:30,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:31,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 01:36:31,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:31,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757375652] [2021-11-06 01:36:31,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:31,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793002999] [2021-11-06 01:36:31,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793002999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:31,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:31,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 01:36:31,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508106586] [2021-11-06 01:36:31,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:31,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:36:31,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 01:36:31,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:36:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:31,032 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2021-11-06 01:36:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:31,172 INFO L93 Difference]: Finished difference Result 653 states and 790 transitions. [2021-11-06 01:36:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 103 [2021-11-06 01:36:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:31,173 INFO L225 Difference]: With dead ends: 653 [2021-11-06 01:36:31,174 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 01:36:31,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.53ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:31,174 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 416 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.24ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.38ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:31,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 365 Invalid, 77 Unknown, 0 Unchecked, 1.24ms Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 122.38ms Time] [2021-11-06 01:36:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 01:36:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2021-11-06 01:36:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 1.2144702842377262) internal successors, (470), 388 states have internal predecessors, (470), 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) [2021-11-06 01:36:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2021-11-06 01:36:31,182 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 103 [2021-11-06 01:36:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:31,182 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2021-11-06 01:36:31,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2021-11-06 01:36:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2021-11-06 01:36:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 01:36:31,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:31,183 INFO L514 BasicCegarLoop]: 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, 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, 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, 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, 1] [2021-11-06 01:36:31,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:31,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:31,404 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-06 01:36:31,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 01:36:31,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839813244] [2021-11-06 01:36:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:31,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 01:36:31,418 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 01:36:31,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913593711] [2021-11-06 01:36:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:31,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 01:36:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:31,419 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) [2021-11-06 01:36:31,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 01:36:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:31,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-06 01:36:31,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:31,562 INFO L388 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 6 treesize of output 5 [2021-11-06 01:36:31,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 01:36:31,595 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 01:36:31,595 INFO L388 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-06 01:36:31,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:31,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:31,638 INFO L388 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 38 treesize of output 29 [2021-11-06 01:36:32,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2021-11-06 01:36:32,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 44 [2021-11-06 01:36:32,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2021-11-06 01:36:32,390 INFO L388 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 40 treesize of output 36 [2021-11-06 01:36:32,405 INFO L354 Elim1Store]: treesize reduction 70, result has 23.1 percent of original size [2021-11-06 01:36:32,406 INFO L388 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 4 case distinctions, treesize of input 45 treesize of output 52 [2021-11-06 01:36:32,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:32,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 01:36:32,443 INFO L388 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 13 treesize of output 9 [2021-11-06 01:36:33,673 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-06 01:36:33,674 INFO L388 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 2853 treesize of output 2296 [2021-11-06 01:36:33,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:33,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:33,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 01:36:38,255 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-06 01:36:38,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3322 treesize of output 1825 [2021-11-06 01:36:38,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 01:36:38,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839813244] [2021-11-06 01:36:38,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 01:36:38,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913593711] [2021-11-06 01:36:38,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-06 01:36:38,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:38,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 01:36:38,308 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 01:36:38,308 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 01:36:38,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-06 01:36:38,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-06 01:36:38,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:38,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 01:36:38,534 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:38,535 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 01:36:38,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 01:36:38 BoogieIcfgContainer [2021-11-06 01:36:38,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 01:36:38,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 01:36:38,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 01:36:38,559 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 01:36:38,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:36:26" (3/4) ... [2021-11-06 01:36:38,562 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 01:36:38,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 01:36:38,563 INFO L158 Benchmark]: Toolchain (without parser) took 14021.66ms. Allocated memory was 56.6MB in the beginning and 130.0MB in the end (delta: 73.4MB). Free memory was 32.8MB in the beginning and 32.3MB in the end (delta: 466.3kB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2021-11-06 01:36:38,563 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 01:36:38,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.20ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 32.5MB in the beginning and 52.3MB in the end (delta: -19.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2021-11-06 01:36:38,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.64ms. Allocated memory is still 75.5MB. Free memory was 52.3MB in the beginning and 45.1MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 01:36:38,564 INFO L158 Benchmark]: Boogie Preprocessor took 89.96ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 37.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-06 01:36:38,564 INFO L158 Benchmark]: RCFGBuilder took 1048.46ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 37.0MB in the beginning and 72.8MB in the end (delta: -35.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-11-06 01:36:38,564 INFO L158 Benchmark]: TraceAbstraction took 12194.79ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.0MB in the beginning and 33.4MB in the end (delta: 38.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2021-11-06 01:36:38,564 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 130.0MB. Free memory was 33.4MB in the beginning and 32.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 01:36:38,566 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.14ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.20ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 32.5MB in the beginning and 52.3MB in the end (delta: -19.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.64ms. Allocated memory is still 75.5MB. Free memory was 52.3MB in the beginning and 45.1MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.96ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 37.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.46ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 37.0MB in the beginning and 72.8MB in the end (delta: -35.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12194.79ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.0MB in the beginning and 33.4MB in the end (delta: 38.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 130.0MB. Free memory was 33.4MB in the beginning and 32.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 730]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseXor at line 725, overapproximation of bitwiseAnd at line 725. Possible FailurePath: [L713] int i; [L714] example_user_t *user, *tmp, *users=((void *)0); [L715] i=0 [L715] EXPR \read(i) [L715] COND TRUE i<1000 [L716] user = (example_user_t*)malloc(sizeof(example_user_t)) [L717] COND FALSE !(user == ((void *)0)) [L720] EXPR \read(i) [L720] user->id = i [L721] EXPR \read(i) [L721] EXPR \read(i) [L721] user->cookie = i*i [L722] unsigned _ha_hashv; [L722] unsigned _hj_i,_hj_j,_hj_k; [L722] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L722] _ha_hashv = 0xfeedbeefu [L722] EXPR _hj_j = 0x9e3779b9u [L722] _hj_i = _hj_j = 0x9e3779b9u [L722] _hj_k = (unsigned)(sizeof(int)) [L722] COND FALSE !(_hj_k >= 12U) [L722] _ha_hashv += (unsigned)(sizeof(int)) [L722] case 11: [L722] case 10: [L722] case 9: [L722] case 8: [L722] case 7: [L722] case 6: [L722] case 5: [L722] case 4: [L722] EXPR _hj_key[3] [L722] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L722] case 3: [L722] EXPR _hj_key[2] [L722] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L722] case 2: [L722] EXPR _hj_key[1] [L722] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L722] case 1: [L722] EXPR _hj_key[0] [L722] _hj_i += _hj_key[0] [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 13 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 8 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 13 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 12 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 16 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 5 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 3 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 10 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 15 ) [L722] (user)->hh.hashv = (_ha_hashv) [L722] (user)->hh.key = (char*) (&((user)->id)) [L722] (user)->hh.keylen = (unsigned) (sizeof(int)) [L722] COND TRUE !(users) [L722] (user)->hh.next = ((void *)0) [L722] (user)->hh.prev = ((void *)0) [L722] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L722] EXPR (user)->hh.tbl [L722] COND FALSE !(!(user)->hh.tbl) [L722] (user)->hh.tbl [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->tail = &((user)->hh) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->num_buckets = 32U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->log2_num_buckets = 5U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->signature = 0xa0111fe1u [L722] EXPR (user)->hh.tbl [L722] EXPR (user)->hh.tbl->buckets [L722] COND FALSE !(!(user)->hh.tbl->buckets) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets [L722] (users) = (user) [L722] unsigned _ha_bkt; [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_items [L722] (users)->hh.tbl->num_items++ [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_buckets [L722] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->buckets [L722] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L722] EXPR _ha_head->count [L722] _ha_head->count++ [L722] EXPR _ha_head->hh_head [L722] (&(user)->hh)->hh_next = _ha_head->hh_head [L722] (&(user)->hh)->hh_prev = ((void *)0) [L722] EXPR _ha_head->hh_head [L722] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L722] _ha_head->hh_head = (&(user)->hh) [L722] EXPR _ha_head->count [L722] EXPR _ha_head->expand_mult [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] EXPR (&(user)->hh)->tbl [L722] EXPR (&(user)->hh)->tbl->noexpand [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L715] EXPR \read(i) [L715] i++ [L715] EXPR \read(i) [L715] COND FALSE !(i<1000) [L724] i=0 [L724] EXPR \read(i) [L724] COND TRUE i<1000 [L725] unsigned _hf_hashv; [L725] unsigned _hj_i,_hj_j,_hj_k; [L725] unsigned const char *_hj_key=(unsigned const char*)(&i); [L725] _hf_hashv = 0xfeedbeefu [L725] EXPR _hj_j = 0x9e3779b9u [L725] _hj_i = _hj_j = 0x9e3779b9u [L725] _hj_k = (unsigned)(sizeof(int)) [L725] COND FALSE !(_hj_k >= 12U) [L725] _hf_hashv += (unsigned)(sizeof(int)) [L725] case 11: [L725] case 10: [L725] case 9: [L725] case 8: [L725] case 7: [L725] case 6: [L725] case 5: [L725] case 4: [L725] EXPR _hj_key[3] [L725] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L725] case 3: [L725] EXPR _hj_key[2] [L725] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L725] case 2: [L725] EXPR _hj_key[1] [L725] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L725] case 1: [L725] EXPR _hj_key[0] [L725] _hj_i += _hj_key[0] [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 13 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 8 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 13 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 12 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 16 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 5 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 3 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 10 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 15 ) [L725] (tmp) = ((void *)0) [L725] COND TRUE \read(*users) [L725] unsigned _hf_bkt; [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->num_buckets [L725] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->buckets [L725] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L725] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L725] (tmp) = ((void *)0) [L725] COND FALSE !((tmp) != ((void *)0)) [L726] COND FALSE !(tmp != ((void *)0)) [L730] reach_error() - UnprovableResult [Line: 734]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 211 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12129.57ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.93ms, AutomataDifference: 1045.97ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 11.80ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 813.92ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 3966 SdHoareTripleChecker+Invalid, 658.74ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1958 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 2008 mSDtfsCounter, 561 mSolverCounterSat, 15.36ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.66ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 82.18ms AutomataMinimizationTime, 9 MinimizatonAttempts, 226 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 352.54ms SsaConstructionTime, 349.42ms SatisfiabilityAnalysisTime, 7863.20ms InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2243 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 01:36:38,608 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/uthash-2.0.2/uthash_OAT_test7-2.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 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 01:36:40,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 01:36:40,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 01:36:40,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 01:36:40,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 01:36:40,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 01:36:40,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 01:36:40,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 01:36:40,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 01:36:40,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 01:36:40,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 01:36:40,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 01:36:40,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 01:36:40,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 01:36:40,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 01:36:40,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 01:36:40,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 01:36:40,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 01:36:40,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 01:36:40,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 01:36:40,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 01:36:40,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 01:36:40,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 01:36:40,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 01:36:40,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 01:36:40,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 01:36:40,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 01:36:40,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 01:36:40,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 01:36:40,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 01:36:40,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 01:36:40,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 01:36:40,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 01:36:40,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 01:36:40,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 01:36:40,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 01:36:40,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 01:36:40,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 01:36:40,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 01:36:40,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 01:36:40,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 01:36:40,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-06 01:36:40,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 01:36:40,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 01:36:40,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 01:36:40,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 01:36:40,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 01:36:40,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 01:36:40,140 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 01:36:40,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 01:36:40,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 01:36:40,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 01:36:40,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 01:36:40,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 01:36:40,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 01:36:40,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 01:36:40,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 01:36:40,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 01:36:40,146 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 01:36:40,146 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 01:36:40,146 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 01:36:40,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 01:36:40,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 01:36:40,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 01:36:40,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 01:36:40,148 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 -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2021-11-06 01:36:40,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 01:36:40,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 01:36:40,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 01:36:40,372 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 01:36:40,373 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 01:36:40,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2021-11-06 01:36:40,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3a2ac11/a0117905823344cd9404919ab17b4b3c/FLAG815a2a444 [2021-11-06 01:36:40,885 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 01:36:40,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2021-11-06 01:36:40,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3a2ac11/a0117905823344cd9404919ab17b4b3c/FLAG815a2a444 [2021-11-06 01:36:40,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3a2ac11/a0117905823344cd9404919ab17b4b3c [2021-11-06 01:36:40,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 01:36:40,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 01:36:40,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 01:36:40,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 01:36:40,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 01:36:40,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:36:40" (1/1) ... [2021-11-06 01:36:40,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11dc1add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:40, skipping insertion in model container [2021-11-06 01:36:40,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:36:40" (1/1) ... [2021-11-06 01:36:40,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 01:36:40,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 01:36:41,304 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[33021,33034] [2021-11-06 01:36:41,395 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44124,44137] [2021-11-06 01:36:41,396 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44245,44258] [2021-11-06 01:36:41,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 01:36:41,418 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 01:36:41,441 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[33021,33034] [2021-11-06 01:36:41,506 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44124,44137] [2021-11-06 01:36:41,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i[44245,44258] [2021-11-06 01:36:41,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 01:36:41,546 INFO L208 MainTranslator]: Completed translation [2021-11-06 01:36:41,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41 WrapperNode [2021-11-06 01:36:41,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 01:36:41,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 01:36:41,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 01:36:41,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 01:36:41,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 01:36:41,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 01:36:41,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 01:36:41,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 01:36:41,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 01:36:41,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 01:36:41,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 01:36:41,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 01:36:41,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (1/1) ... [2021-11-06 01:36:41,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 01:36:41,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 01:36:41,760 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) [2021-11-06 01:36:41,787 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 [2021-11-06 01:36:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 01:36:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 01:36:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 01:36:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 01:36:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 01:36:41,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 01:36:45,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 01:36:45,173 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-06 01:36:45,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:36:45 BoogieIcfgContainer [2021-11-06 01:36:45,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 01:36:45,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 01:36:45,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 01:36:45,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 01:36:45,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:36:40" (1/3) ... [2021-11-06 01:36:45,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3f2182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:36:45, skipping insertion in model container [2021-11-06 01:36:45,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:36:41" (2/3) ... [2021-11-06 01:36:45,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3f2182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:36:45, skipping insertion in model container [2021-11-06 01:36:45,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:36:45" (3/3) ... [2021-11-06 01:36:45,180 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-2.i [2021-11-06 01:36:45,183 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 01:36:45,184 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 01:36:45,223 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 01:36:45,230 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 01:36:45,230 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 01:36:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 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) [2021-11-06 01:36:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 01:36:45,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:45,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:45,249 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 01:36:45,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:45,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19215784] [2021-11-06 01:36:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:45,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:45,263 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) [2021-11-06 01:36:45,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 01:36:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:45,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 01:36:45,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:45,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:45,470 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:45,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19215784] [2021-11-06 01:36:45,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19215784] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:45,471 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:45,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 01:36:45,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889249769] [2021-11-06 01:36:45,473 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:45,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 01:36:45,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 01:36:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 01:36:45,516 INFO L87 Difference]: Start difference. First operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 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) [2021-11-06 01:36:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:45,541 INFO L93 Difference]: Finished difference Result 419 states and 707 transitions. [2021-11-06 01:36:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 01:36:45,544 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 [2021-11-06 01:36:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:45,550 INFO L225 Difference]: With dead ends: 419 [2021-11-06 01:36:45,550 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 01:36:45,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.07ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 01:36:45,555 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.90ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:45,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.90ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 01:36:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 01:36:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 01:36:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 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) [2021-11-06 01:36:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 01:36:45,583 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 01:36:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:45,583 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 01:36:45,583 INFO L471 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) [2021-11-06 01:36:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 01:36:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 01:36:45,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:45,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:45,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:45,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:45,792 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 01:36:45,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:45,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595977318] [2021-11-06 01:36:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:45,796 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:45,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:45,797 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) [2021-11-06 01:36:45,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 01:36:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:45,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:45,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:45,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 01:36:46,006 INFO L388 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 [2021-11-06 01:36:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:46,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:46,073 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:46,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595977318] [2021-11-06 01:36:46,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595977318] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:46,073 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:46,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 01:36:46,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499284506] [2021-11-06 01:36:46,074 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:46,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 01:36:46,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 01:36:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 01:36:46,075 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2021-11-06 01:36:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:47,732 INFO L93 Difference]: Finished difference Result 468 states and 614 transitions. [2021-11-06 01:36:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 01:36:47,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 [2021-11-06 01:36:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:47,736 INFO L225 Difference]: With dead ends: 468 [2021-11-06 01:36:47,736 INFO L226 Difference]: Without dead ends: 381 [2021-11-06 01:36:47,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.08ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 01:36:47,738 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 396 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1462.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.77ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1616.53ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:47,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 652 Invalid, 206 Unknown, 0 Unchecked, 5.77ms Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 1616.53ms Time] [2021-11-06 01:36:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-06 01:36:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 179. [2021-11-06 01:36:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 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) [2021-11-06 01:36:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 01:36:47,775 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 01:36:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:47,776 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 01:36:47,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2021-11-06 01:36:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 01:36:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 01:36:47,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:47,778 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:47,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:47,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:47,986 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 01:36:47,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:47,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218941479] [2021-11-06 01:36:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:47,987 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:47,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:47,988 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) [2021-11-06 01:36:47,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 01:36:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:48,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:48,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:48,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:48,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:48,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218941479] [2021-11-06 01:36:48,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218941479] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:48,380 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:48,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 01:36:48,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639916562] [2021-11-06 01:36:48,380 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:48,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 01:36:48,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 01:36:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:48,381 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 01:36:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:48,465 INFO L93 Difference]: Finished difference Result 363 states and 476 transitions. [2021-11-06 01:36:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 01:36:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:48,466 INFO L225 Difference]: With dead ends: 363 [2021-11-06 01:36:48,466 INFO L226 Difference]: Without dead ends: 188 [2021-11-06 01:36:48,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.37ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 01:36:48,467 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 217 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.20ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.46ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:48,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 423 Invalid, 69 Unknown, 0 Unchecked, 1.20ms Time], IncrementalHoareTripleChecker [30 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 70.46ms Time] [2021-11-06 01:36:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-06 01:36:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2021-11-06 01:36:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2722222222222221) internal successors, (229), 181 states have internal predecessors, (229), 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) [2021-11-06 01:36:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2021-11-06 01:36:48,488 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 62 [2021-11-06 01:36:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:48,489 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2021-11-06 01:36:48,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 01:36:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2021-11-06 01:36:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 01:36:48,490 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:48,490 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:48,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:48,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:48,700 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 01:36:48,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:48,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242625296] [2021-11-06 01:36:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:48,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:48,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:48,703 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) [2021-11-06 01:36:48,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 01:36:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:48,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:48,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:49,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:49,364 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:49,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242625296] [2021-11-06 01:36:49,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242625296] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:49,365 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:49,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 01:36:49,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29679912] [2021-11-06 01:36:49,365 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:49,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 01:36:49,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 01:36:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:49,366 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-11-06 01:36:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:50,017 INFO L93 Difference]: Finished difference Result 470 states and 590 transitions. [2021-11-06 01:36:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 01:36:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-06 01:36:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:50,019 INFO L225 Difference]: With dead ends: 470 [2021-11-06 01:36:50,019 INFO L226 Difference]: Without dead ends: 292 [2021-11-06 01:36:50,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.77ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 01:36:50,020 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 101 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 600.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.13ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 640.35ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:50,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 451 Invalid, 36 Unknown, 0 Unchecked, 1.13ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 640.35ms Time] [2021-11-06 01:36:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-06 01:36:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 285. [2021-11-06 01:36:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 283 states have (on average 1.265017667844523) internal successors, (358), 284 states have internal predecessors, (358), 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) [2021-11-06 01:36:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 358 transitions. [2021-11-06 01:36:50,028 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 358 transitions. Word has length 62 [2021-11-06 01:36:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:50,028 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 358 transitions. [2021-11-06 01:36:50,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2021-11-06 01:36:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 358 transitions. [2021-11-06 01:36:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 01:36:50,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:50,029 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:50,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:50,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:50,238 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 01:36:50,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:50,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111124786] [2021-11-06 01:36:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:50,239 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:50,240 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) [2021-11-06 01:36:50,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 01:36:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:50,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:50,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:50,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 01:36:50,566 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:50,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111124786] [2021-11-06 01:36:50,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111124786] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:50,566 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:50,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 01:36:50,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658029009] [2021-11-06 01:36:50,567 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:50,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:36:50,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:36:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:50,568 INFO L87 Difference]: Start difference. First operand 285 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-11-06 01:36:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:50,611 INFO L93 Difference]: Finished difference Result 528 states and 673 transitions. [2021-11-06 01:36:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 69 [2021-11-06 01:36:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:50,612 INFO L225 Difference]: With dead ends: 528 [2021-11-06 01:36:50,613 INFO L226 Difference]: Without dead ends: 288 [2021-11-06 01:36:50,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.62ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:36:50,614 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.57ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.80ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:50,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 14 Unknown, 0 Unchecked, 0.57ms Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 35.80ms Time] [2021-11-06 01:36:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-06 01:36:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-06 01:36:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 286 states have (on average 1.2622377622377623) internal successors, (361), 287 states have internal predecessors, (361), 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) [2021-11-06 01:36:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2021-11-06 01:36:50,621 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 69 [2021-11-06 01:36:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:50,621 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2021-11-06 01:36:50,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-11-06 01:36:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2021-11-06 01:36:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 01:36:50,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:50,623 INFO L514 BasicCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:50,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:50,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:50,833 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 982130832, now seen corresponding path program 1 times [2021-11-06 01:36:50,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:50,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735070377] [2021-11-06 01:36:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:50,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:50,852 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) [2021-11-06 01:36:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 01:36:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:51,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 01:36:51,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 01:36:51,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 01:36:51,318 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:51,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735070377] [2021-11-06 01:36:51,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735070377] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:36:51,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:36:51,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 01:36:51,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960733945] [2021-11-06 01:36:51,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:36:51,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 01:36:51,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 01:36:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 01:36:51,319 INFO L87 Difference]: Start difference. First operand 288 states and 361 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2021-11-06 01:36:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:51,507 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2021-11-06 01:36:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 01:36:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 72 [2021-11-06 01:36:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:51,509 INFO L225 Difference]: With dead ends: 537 [2021-11-06 01:36:51,509 INFO L226 Difference]: Without dead ends: 294 [2021-11-06 01:36:51,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 118.68ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 01:36:51,510 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.14ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 120.65ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:51,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 855 Invalid, 50 Unknown, 0 Unchecked, 1.14ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 120.65ms Time] [2021-11-06 01:36:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-06 01:36:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-06 01:36:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 1.2568493150684932) internal successors, (367), 293 states have internal predecessors, (367), 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) [2021-11-06 01:36:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2021-11-06 01:36:51,516 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 72 [2021-11-06 01:36:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:51,516 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2021-11-06 01:36:51,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2021-11-06 01:36:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2021-11-06 01:36:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 01:36:51,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:51,518 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:51,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:51,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:51,728 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2058438736, now seen corresponding path program 2 times [2021-11-06 01:36:51,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:51,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675257773] [2021-11-06 01:36:51,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 01:36:51,729 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:51,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:51,731 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) [2021-11-06 01:36:51,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 01:36:51,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 01:36:51,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 01:36:51,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:51,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:51,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 01:36:51,966 INFO L388 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 [2021-11-06 01:36:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 01:36:51,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 01:36:52,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:52,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675257773] [2021-11-06 01:36:52,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675257773] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:52,053 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:52,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 01:36:52,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442886217] [2021-11-06 01:36:52,053 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:52,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 01:36:52,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:52,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 01:36:52,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 01:36:52,054 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 01:36:53,809 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 01:36:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:56,119 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2021-11-06 01:36:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 01:36:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-06 01:36:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:56,122 INFO L225 Difference]: With dead ends: 448 [2021-11-06 01:36:56,122 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 01:36:56,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.87ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 01:36:56,122 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 207 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3854.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.41ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4029.65ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:56,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 927 Invalid, 274 Unknown, 0 Unchecked, 3.41ms Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 4029.65ms Time] [2021-11-06 01:36:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 01:36:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 365. [2021-11-06 01:36:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 363 states have (on average 1.2754820936639117) internal successors, (463), 364 states have internal predecessors, (463), 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) [2021-11-06 01:36:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 463 transitions. [2021-11-06 01:36:56,130 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 463 transitions. Word has length 78 [2021-11-06 01:36:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:56,131 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 463 transitions. [2021-11-06 01:36:56,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 01:36:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 463 transitions. [2021-11-06 01:36:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 01:36:56,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:56,135 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:56,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:56,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:56,356 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-06 01:36:56,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:56,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335461895] [2021-11-06 01:36:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:56,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:56,358 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) [2021-11-06 01:36:56,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 01:36:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:56,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 01:36:56,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 01:36:56,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 01:36:57,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:57,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335461895] [2021-11-06 01:36:57,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335461895] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:36:57,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:36:57,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-06 01:36:57,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000093574] [2021-11-06 01:36:57,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:36:57,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 01:36:57,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:57,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 01:36:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 01:36:57,176 INFO L87 Difference]: Start difference. First operand 365 states and 463 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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) [2021-11-06 01:36:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:58,383 INFO L93 Difference]: Finished difference Result 697 states and 901 transitions. [2021-11-06 01:36:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 01:36:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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 112 [2021-11-06 01:36:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:58,385 INFO L225 Difference]: With dead ends: 697 [2021-11-06 01:36:58,385 INFO L226 Difference]: Without dead ends: 377 [2021-11-06 01:36:58,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 624.67ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-06 01:36:58,386 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 771.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 819.91ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:58,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1703 Invalid, 158 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [45 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 819.91ms Time] [2021-11-06 01:36:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-06 01:36:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-11-06 01:36:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.2666666666666666) internal successors, (475), 376 states have internal predecessors, (475), 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) [2021-11-06 01:36:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 475 transitions. [2021-11-06 01:36:58,394 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 475 transitions. Word has length 112 [2021-11-06 01:36:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:58,394 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 475 transitions. [2021-11-06 01:36:58,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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) [2021-11-06 01:36:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 475 transitions. [2021-11-06 01:36:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 01:36:58,395 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:58,395 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:58,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 01:36:58,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:58,596 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-06 01:36:58,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:58,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123373791] [2021-11-06 01:36:58,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 01:36:58,597 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:58,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:58,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 01:36:58,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 01:36:58,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 01:36:58,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 01:36:58,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:36:58,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 01:36:58,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:36:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 01:36:59,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:36:59,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123373791] [2021-11-06 01:36:59,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123373791] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:36:59,014 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:36:59,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 01:36:59,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449608114] [2021-11-06 01:36:59,014 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:36:59,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 01:36:59,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:36:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 01:36:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:36:59,015 INFO L87 Difference]: Start difference. First operand 377 states and 475 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2021-11-06 01:36:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:36:59,094 INFO L93 Difference]: Finished difference Result 603 states and 784 transitions. [2021-11-06 01:36:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:36:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 124 [2021-11-06 01:36:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:36:59,095 INFO L225 Difference]: With dead ends: 603 [2021-11-06 01:36:59,095 INFO L226 Difference]: Without dead ends: 389 [2021-11-06 01:36:59,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.94ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 01:36:59,096 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.41ms IncrementalHoareTripleChecker+Time [2021-11-06 01:36:59,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 68 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [30 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 64.41ms Time] [2021-11-06 01:36:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-06 01:36:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2021-11-06 01:36:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 384 states have (on average 1.1979166666666667) internal successors, (460), 385 states have internal predecessors, (460), 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) [2021-11-06 01:36:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2021-11-06 01:36:59,109 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 124 [2021-11-06 01:36:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:36:59,109 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2021-11-06 01:36:59,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2021-11-06 01:36:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2021-11-06 01:36:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 01:36:59,110 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:36:59,110 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:36:59,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-06 01:36:59,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:36:59,319 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:36:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:36:59,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-06 01:36:59,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:36:59,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706751950] [2021-11-06 01:36:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:36:59,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:36:59,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:36:59,321 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) [2021-11-06 01:36:59,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 01:36:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:36:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 01:36:59,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:36:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 01:36:59,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:37:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 01:37:00,822 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:37:00,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706751950] [2021-11-06 01:37:00,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706751950] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:37:00,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:37:00,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-06 01:37:00,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396171163] [2021-11-06 01:37:00,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:37:00,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 01:37:00,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:37:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 01:37:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-06 01:37:00,824 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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) [2021-11-06 01:37:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:37:08,778 INFO L93 Difference]: Finished difference Result 751 states and 919 transitions. [2021-11-06 01:37:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 01:37:08,779 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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 124 [2021-11-06 01:37:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:37:08,780 INFO L225 Difference]: With dead ends: 751 [2021-11-06 01:37:08,780 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 01:37:08,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3374.15ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 01:37:08,782 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5229.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3826 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.89ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5386.80ms IncrementalHoareTripleChecker+Time [2021-11-06 01:37:08,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3826 Invalid, 536 Unknown, 0 Unchecked, 3.89ms Time], IncrementalHoareTripleChecker [157 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 5386.80ms Time] [2021-11-06 01:37:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 01:37:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-06 01:37:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1862745098039216) internal successors, (484), 409 states have internal predecessors, (484), 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) [2021-11-06 01:37:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2021-11-06 01:37:08,791 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 124 [2021-11-06 01:37:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:37:08,791 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2021-11-06 01:37:08,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 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) [2021-11-06 01:37:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2021-11-06 01:37:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 01:37:08,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:37:08,793 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:37:08,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 01:37:09,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:37:09,005 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:37:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:37:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-06 01:37:09,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:37:09,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792271626] [2021-11-06 01:37:09,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 01:37:09,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:37:09,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:37:09,007 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) [2021-11-06 01:37:09,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 01:37:09,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 01:37:09,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 01:37:09,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 01:37:09,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:37:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 01:37:09,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:37:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 01:37:09,492 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:37:09,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792271626] [2021-11-06 01:37:09,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792271626] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:37:09,492 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:37:09,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-06 01:37:09,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56424513] [2021-11-06 01:37:09,493 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:37:09,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 01:37:09,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:37:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 01:37:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:37:09,494 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2021-11-06 01:37:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:37:09,569 INFO L93 Difference]: Finished difference Result 611 states and 731 transitions. [2021-11-06 01:37:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 01:37:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 148 [2021-11-06 01:37:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:37:09,572 INFO L225 Difference]: With dead ends: 611 [2021-11-06 01:37:09,572 INFO L226 Difference]: Without dead ends: 413 [2021-11-06 01:37:09,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.83ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:37:09,573 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 3 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.51ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.69ms IncrementalHoareTripleChecker+Time [2021-11-06 01:37:09,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 746 Invalid, 88 Unknown, 0 Unchecked, 0.51ms Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 66.69ms Time] [2021-11-06 01:37:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-06 01:37:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2021-11-06 01:37:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1642156862745099) internal successors, (475), 409 states have internal predecessors, (475), 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) [2021-11-06 01:37:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2021-11-06 01:37:09,586 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 148 [2021-11-06 01:37:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:37:09,587 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2021-11-06 01:37:09,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2021-11-06 01:37:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2021-11-06 01:37:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 01:37:09,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:37:09,588 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:37:09,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 01:37:09,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:37:09,796 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:37:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:37:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-06 01:37:09,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:37:09,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018177572] [2021-11-06 01:37:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:37:09,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:37:09,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:37:09,798 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 01:37:09,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 01:37:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:37:10,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 01:37:10,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:37:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 01:37:10,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:37:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 01:37:13,330 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:37:13,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018177572] [2021-11-06 01:37:13,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018177572] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:37:13,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:37:13,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-06 01:37:13,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790757749] [2021-11-06 01:37:13,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:37:13,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-06 01:37:13,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:37:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-06 01:37:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 01:37:13,341 INFO L87 Difference]: Start difference. First operand 410 states and 475 transitions. Second operand has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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) [2021-11-06 01:38:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:38:10,516 INFO L93 Difference]: Finished difference Result 805 states and 961 transitions. [2021-11-06 01:38:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 01:38:10,528 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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 148 [2021-11-06 01:38:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:38:10,529 INFO L225 Difference]: With dead ends: 805 [2021-11-06 01:38:10,530 INFO L226 Difference]: Without dead ends: 440 [2021-11-06 01:38:10,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 20782.23ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-06 01:38:10,532 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38399.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.50ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38955.32ms IncrementalHoareTripleChecker+Time [2021-11-06 01:38:10,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7243 Invalid, 1673 Unknown, 0 Unchecked, 9.50ms Time], IncrementalHoareTripleChecker [555 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 38955.32ms Time] [2021-11-06 01:38:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-06 01:38:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-11-06 01:38:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 438 states have (on average 1.1529680365296804) internal successors, (505), 439 states have internal predecessors, (505), 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) [2021-11-06 01:38:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2021-11-06 01:38:10,545 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 148 [2021-11-06 01:38:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:38:10,545 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2021-11-06 01:38:10,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 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) [2021-11-06 01:38:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2021-11-06 01:38:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 01:38:10,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:38:10,547 INFO L514 BasicCegarLoop]: trace histogram [44, 31, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:38:10,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 01:38:10,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:38:10,763 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:38:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:38:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-06 01:38:10,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:38:10,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612425962] [2021-11-06 01:38:10,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 01:38:10,765 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:38:10,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:38:10,766 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) [2021-11-06 01:38:10,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 01:38:11,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 01:38:11,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 01:38:11,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 01:38:11,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:38:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 01:38:12,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:38:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 01:38:15,891 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:38:15,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612425962] [2021-11-06 01:38:15,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612425962] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:38:15,891 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:38:15,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-06 01:38:15,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852870774] [2021-11-06 01:38:15,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:38:15,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-06 01:38:15,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:38:15,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-06 01:38:15,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-06 01:38:15,893 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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) [2021-11-06 01:39:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:39:31,086 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2021-11-06 01:39:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 01:39:31,087 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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 178 [2021-11-06 01:39:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:39:31,088 INFO L225 Difference]: With dead ends: 868 [2021-11-06 01:39:31,088 INFO L226 Difference]: Without dead ends: 473 [2021-11-06 01:39:31,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 30540.91ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-06 01:39:31,091 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47329.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.16ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48166.05ms IncrementalHoareTripleChecker+Time [2021-11-06 01:39:31,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7243 Invalid, 1922 Unknown, 0 Unchecked, 13.16ms Time], IncrementalHoareTripleChecker [591 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 48166.05ms Time] [2021-11-06 01:39:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-06 01:39:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-11-06 01:39:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 1.1422505307855626) internal successors, (538), 472 states have internal predecessors, (538), 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) [2021-11-06 01:39:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 538 transitions. [2021-11-06 01:39:31,114 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 538 transitions. Word has length 178 [2021-11-06 01:39:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:39:31,114 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 538 transitions. [2021-11-06 01:39:31,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 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) [2021-11-06 01:39:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 538 transitions. [2021-11-06 01:39:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-06 01:39:31,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:39:31,116 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:39:31,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 01:39:31,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:39:31,327 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:39:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:39:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-06 01:39:31,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:39:31,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28729446] [2021-11-06 01:39:31,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 01:39:31,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:39:31,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:39:31,330 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 01:39:31,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 01:39:31,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 01:39:31,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 01:39:31,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 01:39:31,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:39:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 01:39:32,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:39:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 01:39:32,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:39:32,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28729446] [2021-11-06 01:39:32,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28729446] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 01:39:32,443 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 01:39:32,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 01:39:32,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920777726] [2021-11-06 01:39:32,444 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 01:39:32,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 01:39:32,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:39:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 01:39:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 01:39:32,445 INFO L87 Difference]: Start difference. First operand 473 states and 538 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2021-11-06 01:39:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:39:35,172 INFO L93 Difference]: Finished difference Result 983 states and 1122 transitions. [2021-11-06 01:39:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 01:39:35,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 211 [2021-11-06 01:39:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:39:35,175 INFO L225 Difference]: With dead ends: 983 [2021-11-06 01:39:35,175 INFO L226 Difference]: Without dead ends: 555 [2021-11-06 01:39:35,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 01:39:35,176 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 395 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2571.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.21ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2693.53ms IncrementalHoareTripleChecker+Time [2021-11-06 01:39:35,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 335 Invalid, 83 Unknown, 0 Unchecked, 1.21ms Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 2693.53ms Time] [2021-11-06 01:39:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-06 01:39:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 548. [2021-11-06 01:39:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 546 states have (on average 1.1446886446886446) internal successors, (625), 547 states have internal predecessors, (625), 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) [2021-11-06 01:39:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 625 transitions. [2021-11-06 01:39:35,194 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 625 transitions. Word has length 211 [2021-11-06 01:39:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:39:35,194 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 625 transitions. [2021-11-06 01:39:35,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2021-11-06 01:39:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 625 transitions. [2021-11-06 01:39:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 01:39:35,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:39:35,196 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:39:35,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 01:39:35,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:39:35,407 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:39:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:39:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-06 01:39:35,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:39:35,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925447862] [2021-11-06 01:39:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 01:39:35,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:39:35,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:39:35,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 01:39:35,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 01:39:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 01:39:36,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-06 01:39:36,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:39:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 01:39:39,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:39:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 01:39:51,068 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:39:51,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925447862] [2021-11-06 01:39:51,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925447862] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:39:51,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:39:51,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-06 01:39:51,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493374343] [2021-11-06 01:39:51,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:39:51,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-06 01:39:51,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:39:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-06 01:39:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-06 01:39:51,076 INFO L87 Difference]: Start difference. First operand 548 states and 625 transitions. Second operand has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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) [2021-11-06 01:43:38,759 WARN L230 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 196 [2021-11-06 01:43:46,812 WARN L230 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 193 [2021-11-06 01:43:54,685 WARN L230 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 190 [2021-11-06 01:44:02,847 WARN L230 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 187 [2021-11-06 01:44:10,772 WARN L230 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 184 [2021-11-06 01:44:12,866 WARN L860 $PredicateComparison]: unable to prove that (and (bvult (bvadd (_ bv29 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv50 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv53 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv14 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv1 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv24 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv6 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv39 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv26 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv54 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv55 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv20 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv36 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv2 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv59 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv48 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv38 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv46 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv18 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv7 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv45 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv28 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv23 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv33 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv58 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv32 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv41 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv8 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv19 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv4 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv35 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv34 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv42 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv47 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv37 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv57 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv44 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv52 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv13 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv16 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv56 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv30 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv12 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv10 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv21 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv3 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv43 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv51 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv9 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv15 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv5 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv11 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv25 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv27 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv49 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv22 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv40 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv31 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv17 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|)) is different from true [2021-11-06 01:44:42,448 WARN L230 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 169 [2021-11-06 01:45:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 01:45:48,521 INFO L93 Difference]: Finished difference Result 1003 states and 1217 transitions. [2021-11-06 01:45:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-06 01:45:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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 218 [2021-11-06 01:45:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 01:45:48,524 INFO L225 Difference]: With dead ends: 1003 [2021-11-06 01:45:48,524 INFO L226 Difference]: Without dead ends: 614 [2021-11-06 01:45:48,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 241048.52ms TimeCoverageRelationStatistics Valid=12746, Invalid=25087, Unknown=1, NotChecked=386, Total=38220 [2021-11-06 01:45:48,530 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 13869 mSDsCounter, 0 mSdLazyCounter, 4795 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126651.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14077 SdHoareTripleChecker+Invalid, 5915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 33.82ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 129471.05ms IncrementalHoareTripleChecker+Time [2021-11-06 01:45:48,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14077 Invalid, 5915 Unknown, 0 Unchecked, 33.82ms Time], IncrementalHoareTripleChecker [1119 Valid, 4795 Invalid, 0 Unknown, 1 Unchecked, 129471.05ms Time] [2021-11-06 01:45:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-06 01:45:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-11-06 01:45:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.1290849673202614) internal successors, (691), 613 states have internal predecessors, (691), 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) [2021-11-06 01:45:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2021-11-06 01:45:48,564 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 218 [2021-11-06 01:45:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 01:45:48,565 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2021-11-06 01:45:48,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 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) [2021-11-06 01:45:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2021-11-06 01:45:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-06 01:45:48,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 01:45:48,574 INFO L514 BasicCegarLoop]: trace histogram [130, 44, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 01:45:48,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 01:45:48,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 01:45:48,787 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 01:45:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 01:45:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-06 01:45:48,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 01:45:48,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352987022] [2021-11-06 01:45:48,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 01:45:48,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 01:45:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 01:45:48,790 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 01:45:48,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 01:45:50,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 01:45:50,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 01:45:50,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-06 01:45:50,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 01:46:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 01:46:00,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 01:46:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 01:46:42,342 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 01:46:42,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352987022] [2021-11-06 01:46:42,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352987022] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 01:46:42,342 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 01:46:42,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-06 01:46:42,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289556999] [2021-11-06 01:46:42,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 01:46:42,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-06 01:46:42,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 01:46:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-06 01:46:42,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-06 01:46:42,350 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 264 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 264 states have internal predecessors, (373), 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) Killed by 15