./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 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/bitvector/byte_add_2-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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 10:44:26,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 10:44:26,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 10:44:26,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 10:44:26,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 10:44:26,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 10:44:26,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 10:44:26,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 10:44:26,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 10:44:26,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 10:44:26,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 10:44:26,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 10:44:26,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 10:44:26,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 10:44:26,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 10:44:26,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 10:44:26,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 10:44:26,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 10:44:26,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 10:44:26,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 10:44:26,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 10:44:26,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 10:44:26,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 10:44:26,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 10:44:26,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 10:44:26,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 10:44:26,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 10:44:26,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 10:44:26,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 10:44:26,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 10:44:26,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 10:44:26,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 10:44:26,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 10:44:26,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 10:44:26,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 10:44:26,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 10:44:26,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 10:44:26,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 10:44:26,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 10:44:26,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 10:44:26,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 10:44:26,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 10:44:26,757 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 10:44:26,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 10:44:26,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 10:44:26,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 10:44:26,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 10:44:26,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 10:44:26,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 10:44:26,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 10:44:26,761 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 10:44:26,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 10:44:26,762 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 10:44:26,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 10:44:26,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 10:44:26,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 10:44:26,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 10:44:26,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 10:44:26,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 10:44:26,763 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 10:44:26,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 10:44:26,763 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 10:44:26,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 10:44:26,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 10:44:26,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 10:44:26,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 10:44:26,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:44:26,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 10:44:26,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 10:44:26,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 10:44:26,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 10:44:26,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 10:44:26,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 10:44:26,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 10:44:26,766 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 10:44:26,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 10:44:26,766 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 10:44:26,766 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2023-02-14 10:44:27,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 10:44:27,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 10:44:27,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 10:44:27,053 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 10:44:27,053 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 10:44:27,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-14 10:44:28,121 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 10:44:28,312 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 10:44:28,314 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-14 10:44:28,323 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d91bfb7/597056c806ea46eea1c8a88f8fce8330/FLAG37bd2bca9 [2023-02-14 10:44:28,338 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d91bfb7/597056c806ea46eea1c8a88f8fce8330 [2023-02-14 10:44:28,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 10:44:28,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 10:44:28,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 10:44:28,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 10:44:28,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 10:44:28,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baadb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28, skipping insertion in model container [2023-02-14 10:44:28,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 10:44:28,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 10:44:28,537 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-14 10:44:28,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:44:28,597 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 10:44:28,613 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-14 10:44:28,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:44:28,658 INFO L208 MainTranslator]: Completed translation [2023-02-14 10:44:28,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28 WrapperNode [2023-02-14 10:44:28,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 10:44:28,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 10:44:28,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 10:44:28,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 10:44:28,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,717 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2023-02-14 10:44:28,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 10:44:28,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 10:44:28,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 10:44:28,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 10:44:28,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,760 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 10:44:28,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 10:44:28,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 10:44:28,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 10:44:28,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (1/1) ... [2023-02-14 10:44:28,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:44:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:44:28,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 10:44:28,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 10:44:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 10:44:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 10:44:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 10:44:28,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 10:44:28,924 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 10:44:28,926 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 10:44:29,270 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 10:44:29,274 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 10:44:29,274 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 10:44:29,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:44:29 BoogieIcfgContainer [2023-02-14 10:44:29,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 10:44:29,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 10:44:29,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 10:44:29,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 10:44:29,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:44:28" (1/3) ... [2023-02-14 10:44:29,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98f273c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:44:29, skipping insertion in model container [2023-02-14 10:44:29,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:28" (2/3) ... [2023-02-14 10:44:29,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98f273c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:44:29, skipping insertion in model container [2023-02-14 10:44:29,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:44:29" (3/3) ... [2023-02-14 10:44:29,282 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-14 10:44:29,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 10:44:29,313 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 10:44:29,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 10:44:29,386 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@528be316, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 10:44:29,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 10:44:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 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) [2023-02-14 10:44:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 10:44:29,395 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:29,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:29,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash 903950584, now seen corresponding path program 1 times [2023-02-14 10:44:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:29,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096016455] [2023-02-14 10:44:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:29,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096016455] [2023-02-14 10:44:29,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096016455] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:29,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:29,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 10:44:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365179706] [2023-02-14 10:44:29,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:29,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 10:44:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 10:44:29,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:44:29,618 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 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 6.5) internal successors, (13), 2 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) [2023-02-14 10:44:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:29,634 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2023-02-14 10:44:29,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 10:44:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 13 [2023-02-14 10:44:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:29,643 INFO L225 Difference]: With dead ends: 64 [2023-02-14 10:44:29,643 INFO L226 Difference]: Without dead ends: 43 [2023-02-14 10:44:29,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:44:29,649 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:29,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:44:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-14 10:44:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-14 10:44:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 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) [2023-02-14 10:44:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. [2023-02-14 10:44:29,678 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 13 [2023-02-14 10:44:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:29,678 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. [2023-02-14 10:44:29,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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) [2023-02-14 10:44:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. [2023-02-14 10:44:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 10:44:29,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:29,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:29,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 10:44:29,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 430337229, now seen corresponding path program 1 times [2023-02-14 10:44:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:29,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801220317] [2023-02-14 10:44:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:29,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801220317] [2023-02-14 10:44:29,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801220317] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:29,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:29,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 10:44:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076401737] [2023-02-14 10:44:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 10:44:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 10:44:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:44:29,883 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2023-02-14 10:44:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:29,994 INFO L93 Difference]: Finished difference Result 102 states and 179 transitions. [2023-02-14 10:44:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 10:44:29,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 13 [2023-02-14 10:44:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:29,996 INFO L225 Difference]: With dead ends: 102 [2023-02-14 10:44:29,996 INFO L226 Difference]: Without dead ends: 69 [2023-02-14 10:44:29,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:44:29,998 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:29,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-14 10:44:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-02-14 10:44:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 66 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) [2023-02-14 10:44:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2023-02-14 10:44:30,010 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 13 [2023-02-14 10:44:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:30,010 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2023-02-14 10:44:30,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2023-02-14 10:44:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2023-02-14 10:44:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 10:44:30,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:30,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:30,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 10:44:30,012 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2037878536, now seen corresponding path program 1 times [2023-02-14 10:44:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:30,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083557440] [2023-02-14 10:44:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083557440] [2023-02-14 10:44:30,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083557440] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:30,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:30,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274285439] [2023-02-14 10:44:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:30,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:30,163 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-02-14 10:44:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:30,392 INFO L93 Difference]: Finished difference Result 168 states and 287 transitions. [2023-02-14 10:44:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-02-14 10:44:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:30,398 INFO L225 Difference]: With dead ends: 168 [2023-02-14 10:44:30,398 INFO L226 Difference]: Without dead ends: 135 [2023-02-14 10:44:30,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:30,405 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 112 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:30,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 105 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:44:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-14 10:44:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 93. [2023-02-14 10:44:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 92 states have internal predecessors, (143), 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) [2023-02-14 10:44:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2023-02-14 10:44:30,429 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2023-02-14 10:44:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:30,430 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2023-02-14 10:44:30,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-02-14 10:44:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2023-02-14 10:44:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 10:44:30,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:30,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:30,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 10:44:30,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -21369817, now seen corresponding path program 1 times [2023-02-14 10:44:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:30,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094741588] [2023-02-14 10:44:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 10:44:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:30,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094741588] [2023-02-14 10:44:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094741588] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:30,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:30,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889035710] [2023-02-14 10:44:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:30,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:30,564 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:44:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:30,709 INFO L93 Difference]: Finished difference Result 272 states and 412 transitions. [2023-02-14 10:44:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 10:44:30,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-14 10:44:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:30,711 INFO L225 Difference]: With dead ends: 272 [2023-02-14 10:44:30,711 INFO L226 Difference]: Without dead ends: 192 [2023-02-14 10:44:30,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:30,712 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:30,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-14 10:44:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 101. [2023-02-14 10:44:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.52) internal successors, (152), 100 states have internal predecessors, (152), 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) [2023-02-14 10:44:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2023-02-14 10:44:30,722 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 25 [2023-02-14 10:44:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:30,722 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2023-02-14 10:44:30,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:44:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2023-02-14 10:44:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 10:44:30,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:30,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:30,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 10:44:30,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -53067146, now seen corresponding path program 1 times [2023-02-14 10:44:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:30,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575227182] [2023-02-14 10:44:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 10:44:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:30,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575227182] [2023-02-14 10:44:30,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575227182] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:30,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:30,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 10:44:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497363941] [2023-02-14 10:44:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:30,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 10:44:30,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:30,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 10:44:30,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:44:30,906 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-02-14 10:44:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:30,915 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2023-02-14 10:44:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 10:44:30,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2023-02-14 10:44:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:30,917 INFO L225 Difference]: With dead ends: 179 [2023-02-14 10:44:30,917 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 10:44:30,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:44:30,920 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:30,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:44:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 10:44:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-14 10:44:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 92 states have internal predecessors, (139), 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) [2023-02-14 10:44:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2023-02-14 10:44:30,943 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 26 [2023-02-14 10:44:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:30,945 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2023-02-14 10:44:30,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-02-14 10:44:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2023-02-14 10:44:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 10:44:30,948 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:30,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:30,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 10:44:30,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash -350554629, now seen corresponding path program 1 times [2023-02-14 10:44:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:30,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498498375] [2023-02-14 10:44:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:44:31,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:31,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498498375] [2023-02-14 10:44:31,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498498375] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:31,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:31,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879594423] [2023-02-14 10:44:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:31,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:31,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:31,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:31,144 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-02-14 10:44:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:31,292 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-02-14 10:44:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 10:44:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2023-02-14 10:44:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:31,294 INFO L225 Difference]: With dead ends: 273 [2023-02-14 10:44:31,294 INFO L226 Difference]: Without dead ends: 194 [2023-02-14 10:44:31,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:31,296 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 102 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:31,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-14 10:44:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 98. [2023-02-14 10:44:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 97 states have internal predecessors, (144), 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) [2023-02-14 10:44:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2023-02-14 10:44:31,302 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 32 [2023-02-14 10:44:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:31,302 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2023-02-14 10:44:31,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2023-02-14 10:44:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2023-02-14 10:44:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 10:44:31,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:31,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:31,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 10:44:31,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash -143141955, now seen corresponding path program 1 times [2023-02-14 10:44:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452194791] [2023-02-14 10:44:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:44:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452194791] [2023-02-14 10:44:31,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452194791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:31,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:31,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438934814] [2023-02-14 10:44:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:31,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:31,415 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2023-02-14 10:44:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:31,593 INFO L93 Difference]: Finished difference Result 274 states and 429 transitions. [2023-02-14 10:44:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2023-02-14 10:44:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:31,595 INFO L225 Difference]: With dead ends: 274 [2023-02-14 10:44:31,595 INFO L226 Difference]: Without dead ends: 196 [2023-02-14 10:44:31,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:31,598 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:31,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 86 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:44:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-14 10:44:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 137. [2023-02-14 10:44:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.536764705882353) internal successors, (209), 136 states have internal predecessors, (209), 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) [2023-02-14 10:44:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2023-02-14 10:44:31,609 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 33 [2023-02-14 10:44:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:31,609 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2023-02-14 10:44:31,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2023-02-14 10:44:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2023-02-14 10:44:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 10:44:31,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:31,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:31,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 10:44:31,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:31,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1481468776, now seen corresponding path program 1 times [2023-02-14 10:44:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:31,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922026883] [2023-02-14 10:44:31,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 10:44:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922026883] [2023-02-14 10:44:31,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922026883] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:44:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025791559] [2023-02-14 10:44:31,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:31,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:44:31,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:44:31,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:44:31,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 10:44:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:31,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 10:44:31,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 10:44:32,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:32,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025791559] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:32,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 10:44:32,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-14 10:44:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495732276] [2023-02-14 10:44:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:44:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:44:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:44:32,025 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2023-02-14 10:44:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:32,125 INFO L93 Difference]: Finished difference Result 284 states and 447 transitions. [2023-02-14 10:44:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 39 [2023-02-14 10:44:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:32,128 INFO L225 Difference]: With dead ends: 284 [2023-02-14 10:44:32,128 INFO L226 Difference]: Without dead ends: 160 [2023-02-14 10:44:32,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-14 10:44:32,130 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:32,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 82 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-14 10:44:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2023-02-14 10:44:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 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) [2023-02-14 10:44:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 206 transitions. [2023-02-14 10:44:32,142 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 206 transitions. Word has length 39 [2023-02-14 10:44:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:32,142 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 206 transitions. [2023-02-14 10:44:32,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2023-02-14 10:44:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 206 transitions. [2023-02-14 10:44:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 10:44:32,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:32,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:32,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:32,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:44:32,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash -115920210, now seen corresponding path program 1 times [2023-02-14 10:44:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:32,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085286680] [2023-02-14 10:44:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-14 10:44:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:32,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085286680] [2023-02-14 10:44:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085286680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744179913] [2023-02-14 10:44:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:32,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:32,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:32,517 INFO L87 Difference]: Start difference. First operand 137 states and 206 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2023-02-14 10:44:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:32,643 INFO L93 Difference]: Finished difference Result 380 states and 580 transitions. [2023-02-14 10:44:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 53 [2023-02-14 10:44:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:32,645 INFO L225 Difference]: With dead ends: 380 [2023-02-14 10:44:32,645 INFO L226 Difference]: Without dead ends: 258 [2023-02-14 10:44:32,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:32,648 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 99 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:32,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 82 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-14 10:44:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 179. [2023-02-14 10:44:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 178 states have internal predecessors, (277), 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) [2023-02-14 10:44:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2023-02-14 10:44:32,655 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 53 [2023-02-14 10:44:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:32,656 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2023-02-14 10:44:32,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2023-02-14 10:44:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2023-02-14 10:44:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 10:44:32,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:32,658 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:32,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 10:44:32,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash 380800779, now seen corresponding path program 1 times [2023-02-14 10:44:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:32,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411417308] [2023-02-14 10:44:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-14 10:44:32,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:32,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411417308] [2023-02-14 10:44:32,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411417308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:32,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:32,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:44:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59702377] [2023-02-14 10:44:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:32,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:44:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:44:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:32,846 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2023-02-14 10:44:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:33,061 INFO L93 Difference]: Finished difference Result 709 states and 1096 transitions. [2023-02-14 10:44:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 10:44:33,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 66 [2023-02-14 10:44:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:33,063 INFO L225 Difference]: With dead ends: 709 [2023-02-14 10:44:33,063 INFO L226 Difference]: Without dead ends: 546 [2023-02-14 10:44:33,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:44:33,064 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 187 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:33,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 312 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:44:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-02-14 10:44:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 179. [2023-02-14 10:44:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 178 states have internal predecessors, (277), 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) [2023-02-14 10:44:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2023-02-14 10:44:33,074 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 66 [2023-02-14 10:44:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:33,074 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2023-02-14 10:44:33,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2023-02-14 10:44:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2023-02-14 10:44:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-14 10:44:33,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:33,075 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 10:44:33,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1313996354, now seen corresponding path program 1 times [2023-02-14 10:44:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:33,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904875000] [2023-02-14 10:44:33,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-14 10:44:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904875000] [2023-02-14 10:44:33,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904875000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:33,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:33,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 10:44:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295507758] [2023-02-14 10:44:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:33,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:44:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:33,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:44:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:44:33,287 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) [2023-02-14 10:44:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:33,712 INFO L93 Difference]: Finished difference Result 912 states and 1399 transitions. [2023-02-14 10:44:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 10:44:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 67 [2023-02-14 10:44:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:33,715 INFO L225 Difference]: With dead ends: 912 [2023-02-14 10:44:33,715 INFO L226 Difference]: Without dead ends: 749 [2023-02-14 10:44:33,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:44:33,717 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:33,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 602 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 10:44:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2023-02-14 10:44:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 174. [2023-02-14 10:44:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.5664739884393064) internal successors, (271), 173 states have internal predecessors, (271), 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) [2023-02-14 10:44:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 271 transitions. [2023-02-14 10:44:33,729 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 271 transitions. Word has length 67 [2023-02-14 10:44:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:33,729 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 271 transitions. [2023-02-14 10:44:33,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) [2023-02-14 10:44:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 271 transitions. [2023-02-14 10:44:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-14 10:44:33,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:33,730 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:33,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 10:44:33,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:33,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash -725391719, now seen corresponding path program 1 times [2023-02-14 10:44:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:33,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999134766] [2023-02-14 10:44:33,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-14 10:44:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:44:33,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999134766] [2023-02-14 10:44:33,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999134766] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:44:33,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830669701] [2023-02-14 10:44:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:33,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:44:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:44:33,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:44:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 10:44:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:33,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 10:44:33,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-14 10:44:34,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:44:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-14 10:44:34,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830669701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:44:34,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:44:34,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2023-02-14 10:44:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712915555] [2023-02-14 10:44:34,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:44:34,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:44:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:44:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:44:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:44:34,145 INFO L87 Difference]: Start difference. First operand 174 states and 271 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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) [2023-02-14 10:44:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:34,804 INFO L93 Difference]: Finished difference Result 950 states and 1502 transitions. [2023-02-14 10:44:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 10:44:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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 [2023-02-14 10:44:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:34,807 INFO L225 Difference]: With dead ends: 950 [2023-02-14 10:44:34,807 INFO L226 Difference]: Without dead ends: 711 [2023-02-14 10:44:34,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-02-14 10:44:34,809 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 504 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:34,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 341 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:44:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-02-14 10:44:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 493. [2023-02-14 10:44:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 492 states have internal predecessors, (720), 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) [2023-02-14 10:44:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 720 transitions. [2023-02-14 10:44:34,836 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 720 transitions. Word has length 69 [2023-02-14 10:44:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:34,836 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 720 transitions. [2023-02-14 10:44:34,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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) [2023-02-14 10:44:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 720 transitions. [2023-02-14 10:44:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-14 10:44:34,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:34,838 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:34,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:35,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-14 10:44:35,044 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 319706574, now seen corresponding path program 1 times [2023-02-14 10:44:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:44:35,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434356905] [2023-02-14 10:44:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:44:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 10:44:35,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 10:44:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 10:44:35,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 10:44:35,237 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 10:44:35,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 10:44:35,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 10:44:35,242 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:35,245 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 10:44:35,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:44:35 BoogieIcfgContainer [2023-02-14 10:44:35,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 10:44:35,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 10:44:35,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 10:44:35,333 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 10:44:35,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:44:29" (3/4) ... [2023-02-14 10:44:35,335 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 10:44:35,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 10:44:35,336 INFO L158 Benchmark]: Toolchain (without parser) took 6994.04ms. Allocated memory was 121.6MB in the beginning and 184.5MB in the end (delta: 62.9MB). Free memory was 76.6MB in the beginning and 129.2MB in the end (delta: -52.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-02-14 10:44:35,336 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory was 96.0MB in the beginning and 95.9MB in the end (delta: 31.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 10:44:35,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.75ms. Allocated memory is still 121.6MB. Free memory was 76.2MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 10:44:35,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.98ms. Allocated memory is still 121.6MB. Free memory was 64.1MB in the beginning and 61.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-14 10:44:35,337 INFO L158 Benchmark]: Boogie Preprocessor took 45.58ms. Allocated memory is still 121.6MB. Free memory was 61.1MB in the beginning and 59.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 10:44:35,338 INFO L158 Benchmark]: RCFGBuilder took 490.91ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 92.6MB in the beginning and 109.0MB in the end (delta: -16.4MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2023-02-14 10:44:35,339 INFO L158 Benchmark]: TraceAbstraction took 6054.26ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.0MB in the beginning and 130.3MB in the end (delta: -22.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-02-14 10:44:35,339 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 129.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 10:44:35,341 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.19ms. Allocated memory is still 121.6MB. Free memory was 96.0MB in the beginning and 95.9MB in the end (delta: 31.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.75ms. Allocated memory is still 121.6MB. Free memory was 76.2MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.98ms. Allocated memory is still 121.6MB. Free memory was 64.1MB in the beginning and 61.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.58ms. Allocated memory is still 121.6MB. Free memory was 61.1MB in the beginning and 59.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 490.91ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 92.6MB in the beginning and 109.0MB in the end (delta: -16.4MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6054.26ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.0MB in the beginning and 130.3MB in the end (delta: -22.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 129.2MB 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=255, r0=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L83] COND FALSE !(i < na) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L83] COND FALSE !(i < na) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=154, \old(b)=234770789, \result=218103808, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=218103808, r0=255, r1=81, r2=254, r3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1769 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1769 mSDsluCounter, 2227 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1392 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1989 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 835 mSDtfsCounter, 1989 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 208 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1552 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1907 SizeOfPredicates, 6 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 459/491 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 [2023-02-14 10:44:35,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/bitvector/byte_add_2-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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 10:44:37,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 10:44:37,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 10:44:37,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 10:44:37,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 10:44:37,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 10:44:37,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 10:44:37,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 10:44:37,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 10:44:37,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 10:44:37,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 10:44:37,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 10:44:37,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 10:44:37,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 10:44:37,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 10:44:37,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 10:44:37,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 10:44:37,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 10:44:37,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 10:44:37,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 10:44:37,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 10:44:37,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 10:44:37,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 10:44:37,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 10:44:37,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 10:44:37,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 10:44:37,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 10:44:37,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 10:44:37,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 10:44:37,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 10:44:37,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 10:44:37,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 10:44:37,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 10:44:37,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 10:44:37,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 10:44:37,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 10:44:37,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 10:44:37,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 10:44:37,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 10:44:37,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 10:44:37,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 10:44:37,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-14 10:44:37,593 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 10:44:37,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 10:44:37,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 10:44:37,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 10:44:37,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 10:44:37,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 10:44:37,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 10:44:37,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 10:44:37,597 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 10:44:37,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 10:44:37,598 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 10:44:37,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 10:44:37,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 10:44:37,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 10:44:37,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 10:44:37,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 10:44:37,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 10:44:37,600 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 10:44:37,600 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 10:44:37,600 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 10:44:37,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 10:44:37,600 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 10:44:37,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 10:44:37,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 10:44:37,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 10:44:37,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 10:44:37,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:44:37,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 10:44:37,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 10:44:37,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 10:44:37,603 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 10:44:37,603 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 10:44:37,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 10:44:37,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 10:44:37,604 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 10:44:37,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 10:44:37,604 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 10:44:37,604 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 10:44:37,604 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2023-02-14 10:44:37,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 10:44:37,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 10:44:37,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 10:44:37,976 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 10:44:37,977 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 10:44:37,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-14 10:44:39,036 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 10:44:39,262 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 10:44:39,263 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-14 10:44:39,268 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9475c1340/ff46933f2b104bbfb0d2b847ce102b3b/FLAG3ab1290b8 [2023-02-14 10:44:39,284 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9475c1340/ff46933f2b104bbfb0d2b847ce102b3b [2023-02-14 10:44:39,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 10:44:39,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 10:44:39,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 10:44:39,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 10:44:39,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 10:44:39,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72026757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39, skipping insertion in model container [2023-02-14 10:44:39,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 10:44:39,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 10:44:39,495 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-14 10:44:39,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:44:39,561 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 10:44:39,580 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-14 10:44:39,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:44:39,623 INFO L208 MainTranslator]: Completed translation [2023-02-14 10:44:39,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39 WrapperNode [2023-02-14 10:44:39,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 10:44:39,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 10:44:39,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 10:44:39,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 10:44:39,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,676 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-02-14 10:44:39,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 10:44:39,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 10:44:39,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 10:44:39,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 10:44:39,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,721 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 10:44:39,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 10:44:39,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 10:44:39,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 10:44:39,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (1/1) ... [2023-02-14 10:44:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:44:39,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:44:39,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 10:44:39,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 10:44:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 10:44:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 10:44:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 10:44:39,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 10:44:39,879 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 10:44:39,880 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 10:44:40,227 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 10:44:40,235 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 10:44:40,240 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 10:44:40,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:44:40 BoogieIcfgContainer [2023-02-14 10:44:40,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 10:44:40,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 10:44:40,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 10:44:40,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 10:44:40,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:44:39" (1/3) ... [2023-02-14 10:44:40,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673ed934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:44:40, skipping insertion in model container [2023-02-14 10:44:40,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:44:39" (2/3) ... [2023-02-14 10:44:40,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673ed934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:44:40, skipping insertion in model container [2023-02-14 10:44:40,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:44:40" (3/3) ... [2023-02-14 10:44:40,249 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-14 10:44:40,263 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 10:44:40,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 10:44:40,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 10:44:40,320 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@619fcf47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 10:44:40,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 10:44:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 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) [2023-02-14 10:44:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 10:44:40,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:40,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:40,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2023-02-14 10:44:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:40,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396290474] [2023-02-14 10:44:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:40,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:40,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 10:44:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:40,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 10:44:40,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:40,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:40,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:40,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396290474] [2023-02-14 10:44:40,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396290474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:40,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:40,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 10:44:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898008380] [2023-02-14 10:44:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 10:44:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 10:44:40,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:44:40,506 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-14 10:44:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:40,531 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2023-02-14 10:44:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 10:44:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-02-14 10:44:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:40,540 INFO L225 Difference]: With dead ends: 57 [2023-02-14 10:44:40,540 INFO L226 Difference]: Without dead ends: 38 [2023-02-14 10:44:40,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:44:40,547 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:40,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:44:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-14 10:44:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-14 10:44:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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) [2023-02-14 10:44:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2023-02-14 10:44:40,582 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2023-02-14 10:44:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:40,583 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2023-02-14 10:44:40,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-14 10:44:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2023-02-14 10:44:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 10:44:40,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:40,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:40,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-14 10:44:40,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:40,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2023-02-14 10:44:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:40,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036769764] [2023-02-14 10:44:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:40,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:40,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 10:44:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:40,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 10:44:40,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:40,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:40,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:40,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036769764] [2023-02-14 10:44:40,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036769764] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:40,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:40,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067096368] [2023-02-14 10:44:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:40,976 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-02-14 10:44:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:41,106 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2023-02-14 10:44:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 10:44:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-14 10:44:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:41,108 INFO L225 Difference]: With dead ends: 116 [2023-02-14 10:44:41,108 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 10:44:41,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:41,110 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:41,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 10:44:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-02-14 10:44:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 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) [2023-02-14 10:44:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2023-02-14 10:44:41,122 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2023-02-14 10:44:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:41,123 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2023-02-14 10:44:41,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-02-14 10:44:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2023-02-14 10:44:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 10:44:41,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:41,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:41,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:41,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:41,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2023-02-14 10:44:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195330421] [2023-02-14 10:44:41,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:41,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:41,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:41,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:41,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 10:44:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:41,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 10:44:41,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:41,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:41,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195330421] [2023-02-14 10:44:41,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195330421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:41,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:41,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 10:44:41,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102816647] [2023-02-14 10:44:41,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:41,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 10:44:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:41,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 10:44:41,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:44:41,397 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2023-02-14 10:44:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:41,407 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2023-02-14 10:44:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 10:44:41,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 13 [2023-02-14 10:44:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:41,409 INFO L225 Difference]: With dead ends: 86 [2023-02-14 10:44:41,409 INFO L226 Difference]: Without dead ends: 55 [2023-02-14 10:44:41,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:44:41,411 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:41,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:44:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-14 10:44:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-02-14 10:44:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 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) [2023-02-14 10:44:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2023-02-14 10:44:41,419 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2023-02-14 10:44:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:41,420 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2023-02-14 10:44:41,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) [2023-02-14 10:44:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2023-02-14 10:44:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 10:44:41,421 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:41,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:41,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:41,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:41,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2023-02-14 10:44:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:41,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135919068] [2023-02-14 10:44:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:41,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:41,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:41,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:41,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 10:44:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:41,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 10:44:41,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:41,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:41,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:41,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135919068] [2023-02-14 10:44:41,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135919068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:41,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:41,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:44:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207351979] [2023-02-14 10:44:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:41,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:44:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:44:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:41,728 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-02-14 10:44:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:41,892 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2023-02-14 10:44:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 10:44:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-14 10:44:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:41,898 INFO L225 Difference]: With dead ends: 151 [2023-02-14 10:44:41,898 INFO L226 Difference]: Without dead ends: 107 [2023-02-14 10:44:41,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:44:41,907 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:41,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-14 10:44:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2023-02-14 10:44:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 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) [2023-02-14 10:44:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-14 10:44:41,926 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2023-02-14 10:44:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:41,926 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-14 10:44:41,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-02-14 10:44:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-14 10:44:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 10:44:41,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:41,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:41,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:42,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:42,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:42,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2023-02-14 10:44:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:42,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095446279] [2023-02-14 10:44:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:42,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:42,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:42,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:42,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 10:44:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:42,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 10:44:42,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:42,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:42,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:42,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095446279] [2023-02-14 10:44:42,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095446279] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:42,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:42,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:44:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903390608] [2023-02-14 10:44:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:42,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:44:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:42,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:44:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:42,233 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2023-02-14 10:44:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:42,431 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2023-02-14 10:44:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2023-02-14 10:44:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:42,433 INFO L225 Difference]: With dead ends: 201 [2023-02-14 10:44:42,433 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 10:44:42,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:42,434 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 117 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:42,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 312 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:44:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 10:44:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2023-02-14 10:44:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 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) [2023-02-14 10:44:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-14 10:44:42,443 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2023-02-14 10:44:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:42,443 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-14 10:44:42,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2023-02-14 10:44:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-14 10:44:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 10:44:42,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:42,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:42,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:42,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:42,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2023-02-14 10:44:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326580757] [2023-02-14 10:44:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:42,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:42,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:42,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:42,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 10:44:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:42,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 10:44:42,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:42,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:42,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:42,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326580757] [2023-02-14 10:44:42,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326580757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:42,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:42,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 10:44:42,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572066533] [2023-02-14 10:44:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:42,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:44:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:44:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:44:42,751 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2023-02-14 10:44:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:43,185 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2023-02-14 10:44:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 10:44:43,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2023-02-14 10:44:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:43,187 INFO L225 Difference]: With dead ends: 269 [2023-02-14 10:44:43,187 INFO L226 Difference]: Without dead ends: 221 [2023-02-14 10:44:43,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:44:43,188 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 361 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:43,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 462 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 10:44:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-14 10:44:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 57. [2023-02-14 10:44:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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) [2023-02-14 10:44:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2023-02-14 10:44:43,196 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 27 [2023-02-14 10:44:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:43,197 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2023-02-14 10:44:43,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2023-02-14 10:44:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2023-02-14 10:44:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 10:44:43,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:43,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:43,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:43,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2023-02-14 10:44:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:43,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514679704] [2023-02-14 10:44:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:43,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:43,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:43,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:43,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 10:44:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:43,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 10:44:43,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:43,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:43,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:43,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514679704] [2023-02-14 10:44:43,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514679704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:43,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:43,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:44:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331668738] [2023-02-14 10:44:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:44:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:44:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:43,518 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:44:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:43,661 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2023-02-14 10:44:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:43,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-14 10:44:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:43,663 INFO L225 Difference]: With dead ends: 128 [2023-02-14 10:44:43,663 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 10:44:43,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:43,664 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 88 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:43,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 54 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 10:44:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2023-02-14 10:44:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 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) [2023-02-14 10:44:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2023-02-14 10:44:43,676 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 29 [2023-02-14 10:44:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:43,676 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2023-02-14 10:44:43,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:44:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2023-02-14 10:44:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 10:44:43,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:43,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:43,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:43,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:43,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1280602341, now seen corresponding path program 1 times [2023-02-14 10:44:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:43,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510867447] [2023-02-14 10:44:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:43,889 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:43,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-14 10:44:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:43,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 10:44:43,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:44,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:44,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:44,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510867447] [2023-02-14 10:44:44,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510867447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:44,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:44,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:44:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963596150] [2023-02-14 10:44:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:44,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:44:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:44:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:44,008 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2023-02-14 10:44:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:44,143 INFO L93 Difference]: Finished difference Result 226 states and 295 transitions. [2023-02-14 10:44:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:44:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2023-02-14 10:44:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:44,144 INFO L225 Difference]: With dead ends: 226 [2023-02-14 10:44:44,144 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 10:44:44,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:44:44,145 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 85 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:44,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 129 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 10:44:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2023-02-14 10:44:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 132 states have internal predecessors, (174), 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) [2023-02-14 10:44:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2023-02-14 10:44:44,159 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 42 [2023-02-14 10:44:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:44,160 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2023-02-14 10:44:44,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2023-02-14 10:44:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2023-02-14 10:44:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 10:44:44,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:44,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:44,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:44,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:44,374 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -649034713, now seen corresponding path program 1 times [2023-02-14 10:44:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:44,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180568695] [2023-02-14 10:44:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:44,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:44,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-14 10:44:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:44,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 10:44:44,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:44,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:44:44,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180568695] [2023-02-14 10:44:44,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180568695] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:44:44,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:44:44,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:44:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574083528] [2023-02-14 10:44:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:44:44,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:44:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:44:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:44:44,526 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-02-14 10:44:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:44,748 INFO L93 Difference]: Finished difference Result 301 states and 391 transitions. [2023-02-14 10:44:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 10:44:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2023-02-14 10:44:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:44,750 INFO L225 Difference]: With dead ends: 301 [2023-02-14 10:44:44,750 INFO L226 Difference]: Without dead ends: 232 [2023-02-14 10:44:44,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:44:44,751 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 122 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:44,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 271 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:44:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-14 10:44:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 133. [2023-02-14 10:44:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 132 states have internal predecessors, (174), 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) [2023-02-14 10:44:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2023-02-14 10:44:44,762 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 43 [2023-02-14 10:44:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:44,762 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2023-02-14 10:44:44,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-02-14 10:44:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2023-02-14 10:44:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 10:44:44,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:44,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:44,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:44,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:44,980 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2080233776, now seen corresponding path program 1 times [2023-02-14 10:44:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:44,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815226615] [2023-02-14 10:44:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:44,982 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:44,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-14 10:44:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:45,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 10:44:45,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:45,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:44:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:45,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:45,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815226615] [2023-02-14 10:44:45,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815226615] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:44:45,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:44:45,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-14 10:44:45,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81126790] [2023-02-14 10:44:45,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:44:45,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 10:44:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:45,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 10:44:45,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:44:45,222 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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) [2023-02-14 10:44:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:45,456 INFO L93 Difference]: Finished difference Result 451 states and 608 transitions. [2023-02-14 10:44:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 10:44:45,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 44 [2023-02-14 10:44:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:45,458 INFO L225 Difference]: With dead ends: 451 [2023-02-14 10:44:45,458 INFO L226 Difference]: Without dead ends: 335 [2023-02-14 10:44:45,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2023-02-14 10:44:45,459 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 296 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:45,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 376 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-14 10:44:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 192. [2023-02-14 10:44:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 191 states have internal predecessors, (263), 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) [2023-02-14 10:44:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 263 transitions. [2023-02-14 10:44:45,484 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 263 transitions. Word has length 44 [2023-02-14 10:44:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:45,486 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 263 transitions. [2023-02-14 10:44:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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) [2023-02-14 10:44:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 263 transitions. [2023-02-14 10:44:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 10:44:45,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:45,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:45,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:45,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:45,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1822068338, now seen corresponding path program 1 times [2023-02-14 10:44:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:45,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124972129] [2023-02-14 10:44:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:45,699 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:45,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-14 10:44:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:45,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 10:44:45,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:45,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:44:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:45,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124972129] [2023-02-14 10:44:45,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124972129] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:44:45,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:44:45,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-14 10:44:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206370860] [2023-02-14 10:44:45,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:44:45,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 10:44:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:45,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 10:44:45,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:44:45,949 INFO L87 Difference]: Start difference. First operand 192 states and 263 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2023-02-14 10:44:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:46,228 INFO L93 Difference]: Finished difference Result 592 states and 893 transitions. [2023-02-14 10:44:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 10:44:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 44 [2023-02-14 10:44:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:46,231 INFO L225 Difference]: With dead ends: 592 [2023-02-14 10:44:46,231 INFO L226 Difference]: Without dead ends: 417 [2023-02-14 10:44:46,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:44:46,232 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 230 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:46,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 92 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:44:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-02-14 10:44:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 341. [2023-02-14 10:44:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3941176470588235) internal successors, (474), 340 states have internal predecessors, (474), 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) [2023-02-14 10:44:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 474 transitions. [2023-02-14 10:44:46,255 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 474 transitions. Word has length 44 [2023-02-14 10:44:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:46,256 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 474 transitions. [2023-02-14 10:44:46,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2023-02-14 10:44:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2023-02-14 10:44:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-14 10:44:46,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:46,257 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-14 10:44:46,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:46,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:46,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 1 times [2023-02-14 10:44:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:46,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190344541] [2023-02-14 10:44:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:44:46,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:46,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:46,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-14 10:44:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:44:46,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 10:44:46,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 10:44:46,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:44:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 10:44:46,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:46,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190344541] [2023-02-14 10:44:46,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190344541] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:44:46,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:44:46,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2023-02-14 10:44:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257348582] [2023-02-14 10:44:46,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:44:46,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 10:44:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:46,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 10:44:46,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-14 10:44:46,686 INFO L87 Difference]: Start difference. First operand 341 states and 474 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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) [2023-02-14 10:44:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:44:46,882 INFO L93 Difference]: Finished difference Result 945 states and 1261 transitions. [2023-02-14 10:44:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 10:44:46,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 70 [2023-02-14 10:44:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:44:46,885 INFO L225 Difference]: With dead ends: 945 [2023-02-14 10:44:46,885 INFO L226 Difference]: Without dead ends: 621 [2023-02-14 10:44:46,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-02-14 10:44:46,887 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:44:46,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 288 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:44:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-02-14 10:44:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 341. [2023-02-14 10:44:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3764705882352941) internal successors, (468), 340 states have internal predecessors, (468), 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) [2023-02-14 10:44:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 468 transitions. [2023-02-14 10:44:46,913 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 468 transitions. Word has length 70 [2023-02-14 10:44:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:44:46,913 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 468 transitions. [2023-02-14 10:44:46,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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) [2023-02-14 10:44:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 468 transitions. [2023-02-14 10:44:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-14 10:44:46,914 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:44:46,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:44:46,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-14 10:44:47,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:47,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:44:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:44:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2023-02-14 10:44:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:44:47,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559094420] [2023-02-14 10:44:47,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:44:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:44:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:44:47,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:44:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-14 10:44:47,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 10:44:47,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:44:47,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 10:44:47,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:44:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:49,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:44:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:44:51,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:44:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559094420] [2023-02-14 10:44:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559094420] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:44:51,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:44:51,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2023-02-14 10:44:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283308246] [2023-02-14 10:44:51,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:44:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-14 10:44:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:44:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-14 10:44:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2023-02-14 10:44:51,927 INFO L87 Difference]: Start difference. First operand 341 states and 468 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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) [2023-02-14 10:45:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:45:03,280 INFO L93 Difference]: Finished difference Result 2188 states and 2902 transitions. [2023-02-14 10:45:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-02-14 10:45:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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 70 [2023-02-14 10:45:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:45:03,289 INFO L225 Difference]: With dead ends: 2188 [2023-02-14 10:45:03,289 INFO L226 Difference]: Without dead ends: 1999 [2023-02-14 10:45:03,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2223, Invalid=10887, Unknown=0, NotChecked=0, Total=13110 [2023-02-14 10:45:03,295 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 2582 mSDsluCounter, 6871 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 7266 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:45:03,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 7266 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-14 10:45:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2023-02-14 10:45:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 893. [2023-02-14 10:45:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.4002242152466369) internal successors, (1249), 892 states have internal predecessors, (1249), 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) [2023-02-14 10:45:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1249 transitions. [2023-02-14 10:45:03,384 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1249 transitions. Word has length 70 [2023-02-14 10:45:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:45:03,385 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1249 transitions. [2023-02-14 10:45:03,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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) [2023-02-14 10:45:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1249 transitions. [2023-02-14 10:45:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-14 10:45:03,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:45:03,387 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:45:03,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-14 10:45:03,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:03,595 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:45:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:45:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2023-02-14 10:45:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:45:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735178108] [2023-02-14 10:45:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:45:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:45:03,598 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:45:03,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-14 10:45:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:45:03,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 10:45:03,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:45:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-14 10:45:03,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:45:03,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:45:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735178108] [2023-02-14 10:45:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735178108] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:45:03,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:45:03,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 10:45:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742244095] [2023-02-14 10:45:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:45:03,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:45:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:45:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:45:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:45:03,732 INFO L87 Difference]: Start difference. First operand 893 states and 1249 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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) [2023-02-14 10:45:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:45:04,090 INFO L93 Difference]: Finished difference Result 1317 states and 1812 transitions. [2023-02-14 10:45:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:45:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 70 [2023-02-14 10:45:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:45:04,095 INFO L225 Difference]: With dead ends: 1317 [2023-02-14 10:45:04,095 INFO L226 Difference]: Without dead ends: 1140 [2023-02-14 10:45:04,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:45:04,096 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 173 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 10:45:04,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 497 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 10:45:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-02-14 10:45:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 740. [2023-02-14 10:45:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.401894451962111) internal successors, (1036), 739 states have internal predecessors, (1036), 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) [2023-02-14 10:45:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1036 transitions. [2023-02-14 10:45:04,161 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1036 transitions. Word has length 70 [2023-02-14 10:45:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:45:04,161 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1036 transitions. [2023-02-14 10:45:04,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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) [2023-02-14 10:45:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1036 transitions. [2023-02-14 10:45:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-14 10:45:04,162 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:45:04,163 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:45:04,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-14 10:45:04,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:04,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:45:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:45:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2023-02-14 10:45:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:45:04,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574880781] [2023-02-14 10:45:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:45:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:45:04,371 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:45:04,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-14 10:45:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:45:04,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 10:45:04,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:45:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 10:45:04,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:45:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 10:45:04,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:45:04,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574880781] [2023-02-14 10:45:04,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574880781] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:45:04,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:45:04,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-14 10:45:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073585079] [2023-02-14 10:45:04,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:45:04,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 10:45:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:45:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 10:45:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:45:04,736 INFO L87 Difference]: Start difference. First operand 740 states and 1036 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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) [2023-02-14 10:45:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:45:05,543 INFO L93 Difference]: Finished difference Result 2675 states and 3771 transitions. [2023-02-14 10:45:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 10:45:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 [2023-02-14 10:45:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:45:05,549 INFO L225 Difference]: With dead ends: 2675 [2023-02-14 10:45:05,549 INFO L226 Difference]: Without dead ends: 1952 [2023-02-14 10:45:05,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-02-14 10:45:05,550 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 279 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 10:45:05,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 197 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 10:45:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2023-02-14 10:45:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1532. [2023-02-14 10:45:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.4225996080992815) internal successors, (2178), 1531 states have internal predecessors, (2178), 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) [2023-02-14 10:45:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2178 transitions. [2023-02-14 10:45:05,685 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2178 transitions. Word has length 72 [2023-02-14 10:45:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:45:05,685 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 2178 transitions. [2023-02-14 10:45:05,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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) [2023-02-14 10:45:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2178 transitions. [2023-02-14 10:45:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-14 10:45:05,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:45:05,692 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:45:05,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-14 10:45:05,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:05,901 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:45:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:45:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2023-02-14 10:45:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:45:05,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323730911] [2023-02-14 10:45:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:45:05,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:45:05,903 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:45:05,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-14 10:45:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:45:05,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-14 10:45:05,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:45:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:45:08,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:45:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:45:10,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:45:10,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323730911] [2023-02-14 10:45:10,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323730911] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:45:10,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:45:10,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-14 10:45:10,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801561979] [2023-02-14 10:45:10,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:45:10,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 10:45:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:45:10,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 10:45:10,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2023-02-14 10:45:10,962 INFO L87 Difference]: Start difference. First operand 1532 states and 2178 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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) [2023-02-14 10:45:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:45:52,983 INFO L93 Difference]: Finished difference Result 8647 states and 11483 transitions. [2023-02-14 10:45:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2023-02-14 10:45:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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 74 [2023-02-14 10:45:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:45:53,006 INFO L225 Difference]: With dead ends: 8647 [2023-02-14 10:45:53,007 INFO L226 Difference]: Without dead ends: 7760 [2023-02-14 10:45:53,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18480 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=7680, Invalid=51126, Unknown=0, NotChecked=0, Total=58806 [2023-02-14 10:45:53,020 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 2986 mSDsluCounter, 15452 mSDsCounter, 0 mSdLazyCounter, 9091 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2986 SdHoareTripleChecker+Valid, 16169 SdHoareTripleChecker+Invalid, 9405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 9091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:45:53,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2986 Valid, 16169 Invalid, 9405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [314 Valid, 9091 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-02-14 10:45:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2023-02-14 10:45:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 4199. [2023-02-14 10:45:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 4198 states have (on average 1.4204383039542638) internal successors, (5963), 4198 states have internal predecessors, (5963), 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) [2023-02-14 10:45:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 5963 transitions. [2023-02-14 10:45:53,435 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 5963 transitions. Word has length 74 [2023-02-14 10:45:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:45:53,435 INFO L495 AbstractCegarLoop]: Abstraction has 4199 states and 5963 transitions. [2023-02-14 10:45:53,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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) [2023-02-14 10:45:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 5963 transitions. [2023-02-14 10:45:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-14 10:45:53,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:45:53,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2023-02-14 10:45:53,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-14 10:45:53,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:53,644 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:45:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:45:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash -777616002, now seen corresponding path program 1 times [2023-02-14 10:45:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:45:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701218873] [2023-02-14 10:45:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:45:53,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:45:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:45:53,662 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:45:53,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-14 10:45:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:45:53,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 10:45:53,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:45:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:45:56,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:45:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:45:58,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:45:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701218873] [2023-02-14 10:45:58,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701218873] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:45:58,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:45:58,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-14 10:45:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095971714] [2023-02-14 10:45:58,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:45:58,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 10:45:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:45:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 10:45:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2023-02-14 10:45:58,316 INFO L87 Difference]: Start difference. First operand 4199 states and 5963 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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) [2023-02-14 10:46:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:46:19,542 INFO L93 Difference]: Finished difference Result 10135 states and 13775 transitions. [2023-02-14 10:46:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-02-14 10:46:19,543 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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 74 [2023-02-14 10:46:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:46:19,561 INFO L225 Difference]: With dead ends: 10135 [2023-02-14 10:46:19,561 INFO L226 Difference]: Without dead ends: 8300 [2023-02-14 10:46:19,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5270 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=2685, Invalid=18777, Unknown=0, NotChecked=0, Total=21462 [2023-02-14 10:46:19,565 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 1654 mSDsluCounter, 9368 mSDsCounter, 0 mSdLazyCounter, 5411 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 9854 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 5411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-14 10:46:19,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 9854 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 5411 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-02-14 10:46:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2023-02-14 10:46:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 4683. [2023-02-14 10:46:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4683 states, 4682 states have (on average 1.4235369500213584) internal successors, (6665), 4682 states have internal predecessors, (6665), 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) [2023-02-14 10:46:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 6665 transitions. [2023-02-14 10:46:20,078 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 6665 transitions. Word has length 74 [2023-02-14 10:46:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:46:20,079 INFO L495 AbstractCegarLoop]: Abstraction has 4683 states and 6665 transitions. [2023-02-14 10:46:20,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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) [2023-02-14 10:46:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6665 transitions. [2023-02-14 10:46:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-14 10:46:20,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:46:20,084 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:46:20,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-14 10:46:20,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:46:20,298 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:46:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:46:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1420916641, now seen corresponding path program 1 times [2023-02-14 10:46:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:46:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868785943] [2023-02-14 10:46:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:46:20,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:46:20,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:46:20,304 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:46:20,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-14 10:46:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:46:20,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 10:46:20,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:46:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:46:20,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:46:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:46:20,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:46:20,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868785943] [2023-02-14 10:46:20,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868785943] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:46:20,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:46:20,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-14 10:46:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976018712] [2023-02-14 10:46:20,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:46:20,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 10:46:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:46:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 10:46:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-14 10:46:20,630 INFO L87 Difference]: Start difference. First operand 4683 states and 6665 transitions. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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) [2023-02-14 10:46:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:46:22,105 INFO L93 Difference]: Finished difference Result 18051 states and 27684 transitions. [2023-02-14 10:46:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 10:46:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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 76 [2023-02-14 10:46:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:46:22,127 INFO L225 Difference]: With dead ends: 18051 [2023-02-14 10:46:22,127 INFO L226 Difference]: Without dead ends: 9100 [2023-02-14 10:46:22,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:46:22,136 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 417 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:46:22,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 173 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:46:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9100 states. [2023-02-14 10:46:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9100 to 6200. [2023-02-14 10:46:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6200 states, 6199 states have (on average 1.2282626230037104) internal successors, (7614), 6199 states have internal predecessors, (7614), 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) [2023-02-14 10:46:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 7614 transitions. [2023-02-14 10:46:22,816 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 7614 transitions. Word has length 76 [2023-02-14 10:46:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:46:22,817 INFO L495 AbstractCegarLoop]: Abstraction has 6200 states and 7614 transitions. [2023-02-14 10:46:22,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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) [2023-02-14 10:46:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 7614 transitions. [2023-02-14 10:46:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-14 10:46:22,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:46:22,819 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2023-02-14 10:46:22,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-14 10:46:23,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:46:23,028 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:46:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:46:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 881251465, now seen corresponding path program 1 times [2023-02-14 10:46:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:46:23,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654855088] [2023-02-14 10:46:23,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:46:23,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:46:23,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:46:23,031 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:46:23,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-14 10:46:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:46:23,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 10:46:23,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:46:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:46:26,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:46:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:46:29,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:46:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654855088] [2023-02-14 10:46:29,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654855088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:46:29,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:46:29,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-14 10:46:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220879223] [2023-02-14 10:46:29,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:46:29,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-14 10:46:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:46:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-14 10:46:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2023-02-14 10:46:29,953 INFO L87 Difference]: Start difference. First operand 6200 states and 7614 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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) [2023-02-14 10:47:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:47:05,545 INFO L93 Difference]: Finished difference Result 7925 states and 9591 transitions. [2023-02-14 10:47:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-02-14 10:47:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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 77 [2023-02-14 10:47:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:47:05,557 INFO L225 Difference]: With dead ends: 7925 [2023-02-14 10:47:05,558 INFO L226 Difference]: Without dead ends: 7682 [2023-02-14 10:47:05,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9565 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=4344, Invalid=31566, Unknown=0, NotChecked=0, Total=35910 [2023-02-14 10:47:05,561 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 2724 mSDsluCounter, 7757 mSDsCounter, 0 mSdLazyCounter, 4485 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 8039 SdHoareTripleChecker+Invalid, 4717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 4485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-14 10:47:05,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 8039 Invalid, 4717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 4485 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-02-14 10:47:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2023-02-14 10:47:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 6826. [2023-02-14 10:47:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6826 states, 6825 states have (on average 1.2246153846153847) internal successors, (8358), 6825 states have internal predecessors, (8358), 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) [2023-02-14 10:47:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6826 states to 6826 states and 8358 transitions. [2023-02-14 10:47:06,423 INFO L78 Accepts]: Start accepts. Automaton has 6826 states and 8358 transitions. Word has length 77 [2023-02-14 10:47:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:47:06,423 INFO L495 AbstractCegarLoop]: Abstraction has 6826 states and 8358 transitions. [2023-02-14 10:47:06,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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) [2023-02-14 10:47:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6826 states and 8358 transitions. [2023-02-14 10:47:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-14 10:47:06,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:47:06,425 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2023-02-14 10:47:06,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-02-14 10:47:06,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:47:06,634 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:47:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:47:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1269946569, now seen corresponding path program 2 times [2023-02-14 10:47:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:47:06,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398505015] [2023-02-14 10:47:06,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:47:06,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:47:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:47:06,636 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:47:06,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-14 10:47:06,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 10:47:06,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:47:06,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 10:47:06,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:47:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:47:09,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:47:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:47:13,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:47:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398505015] [2023-02-14 10:47:13,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398505015] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:47:13,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:47:13,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-14 10:47:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571395049] [2023-02-14 10:47:13,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:47:13,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-14 10:47:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:47:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-14 10:47:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2267, Unknown=0, NotChecked=0, Total=2450 [2023-02-14 10:47:13,030 INFO L87 Difference]: Start difference. First operand 6826 states and 8358 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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) [2023-02-14 10:48:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:48:17,932 INFO L93 Difference]: Finished difference Result 10719 states and 12903 transitions. [2023-02-14 10:48:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2023-02-14 10:48:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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 77 [2023-02-14 10:48:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:48:17,947 INFO L225 Difference]: With dead ends: 10719 [2023-02-14 10:48:17,947 INFO L226 Difference]: Without dead ends: 9845 [2023-02-14 10:48:17,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24583 ImplicationChecksByTransitivity, 60.4s TimeCoverageRelationStatistics Valid=8391, Invalid=64779, Unknown=0, NotChecked=0, Total=73170 [2023-02-14 10:48:17,955 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 3034 mSDsluCounter, 10628 mSDsCounter, 0 mSdLazyCounter, 5848 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 11093 SdHoareTripleChecker+Invalid, 6177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 5848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-02-14 10:48:17,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 11093 Invalid, 6177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 5848 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-02-14 10:48:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2023-02-14 10:48:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 8035. [2023-02-14 10:48:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8035 states, 8034 states have (on average 1.2230520288772715) internal successors, (9826), 8034 states have internal predecessors, (9826), 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) [2023-02-14 10:48:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 9826 transitions. [2023-02-14 10:48:18,940 INFO L78 Accepts]: Start accepts. Automaton has 8035 states and 9826 transitions. Word has length 77 [2023-02-14 10:48:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:48:18,940 INFO L495 AbstractCegarLoop]: Abstraction has 8035 states and 9826 transitions. [2023-02-14 10:48:18,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 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) [2023-02-14 10:48:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8035 states and 9826 transitions. [2023-02-14 10:48:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-14 10:48:18,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:48:18,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2023-02-14 10:48:18,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-14 10:48:19,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:48:19,151 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:48:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:48:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1690097737, now seen corresponding path program 3 times [2023-02-14 10:48:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 10:48:19,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392494392] [2023-02-14 10:48:19,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 10:48:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 10:48:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 10:48:19,153 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 10:48:19,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-14 10:48:19,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 10:48:19,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:48:19,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 10:48:19,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:48:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:48:22,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:48:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:48:25,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 10:48:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392494392] [2023-02-14 10:48:25,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392494392] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:48:25,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:48:25,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-02-14 10:48:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734895069] [2023-02-14 10:48:25,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:48:25,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-14 10:48:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 10:48:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-14 10:48:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2197, Unknown=0, NotChecked=0, Total=2352 [2023-02-14 10:48:25,134 INFO L87 Difference]: Start difference. First operand 8035 states and 9826 transitions. Second operand has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 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)